Abstract
In this chapter we consider regular factors and f-factors mainly in general graphs. For a positive integer k, a regular spanning subgraph, each of whose vertices has constant degree k, is called a k-regular factor or simply a k- factor (Fig. 3.1). In order to avoid confusion, we use “k-regular factors” in theorems, but often use “k-factors” in proofs or elsewhere.
Keywords
- Bipartite Graph
- Regular Graph
- Hamiltonian Cycle
- Simple Graph
- Disjoint Subset
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). Regular Factors and f-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_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-21919-1_3
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)
