Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Behzad and G. Chartrand, No graph is perfect, Amer. Math. Monthly, 74 (1967), 962–963.
V. Bhat, Characterization of 3-perfect graphical degree seq., Proc. Ind. Nat. Sci. Acad, 41 (1975), 228–244.
P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok, 11 (1960), 264–274.
D.J. Kleitman and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors, Discrete Math., 6 (1973), 79–88.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Chawathe, P.D. (1981). 2-2 Perfect graphic degree sequences. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092263
Download citation
DOI: https://doi.org/10.1007/BFb0092263
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive