Abstract
In this chapter we investigate (g, f)-factors and [a, b]-factors, which are natural generalizations of f-factors and regular factors, respectively. We first give a criterion for a graph to have a (g, f)-factor, which is called the (g, f)-factor theorem. Then we obtain some sufficient conditions for graphs to have (g, f)- factors and [a, b]-factors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). (g, f)-Factors and [a, b]-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_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-21919-1_4
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)