Abstract
In this chapter we investigate a component factor, which is a spanning subgraph having specified components. For example, a K 2-factor, each of whose components is the complete graph K 2, is the same as a 1-factor. For a family S of connected graphs, a subgraph H of a graph G is called an S-subgraph if each component of H is isomorphic to an element of S, and a spanning S-subgraph is called an S-factor. If S consists of exactly one graph K, then a {K}-factor is often called a K-factor.
Keywords
- Bipartite Graph
- Simple Graph
- Component Factor
- Factor Theorem
- Span Subgraph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Akiyama, J., Kano, M. (2011). Component Factors. In: Factors and Factorizations of Graphs. Lecture Notes in Mathematics(), vol 2031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21919-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-21919-1_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21918-4
Online ISBN: 978-3-642-21919-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
