Abstract
In this chapter, we study properties and structures of extremal k-extendable graphs and n-factor-critical graphs. By studying extremal graphs, either maximal or minimal, we are able to obtain effectively more understanding of the graphs, just as applying the extremal technique to other graph theory problems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2009 Higher Education Press, Beijing and Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Yu, Q.R., Liu, G. (2009). Extremal k-Extendable Graphs and Generalizations. In: Graph Factors and Matching Extensions. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93952-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-93952-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93951-1
Online ISBN: 978-3-540-93952-8