Abstract
Graphic sequences every realization of which is outerplanar are characterized.
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
G. Chartrand and F. Harary, Planar permutation graphs, Ann. Inst. H. Princare, Sec. B, 3 (1967), 433–438.
F. Harary, Graph Theory, Addison-Wesley, Mass. 1969.
D.J. Kleitman and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors, Disc. Math., 6 (1973), 79–88.
S.B. Rao, Characterization of forcibly planar degree sequences, I.S.I. Tech. Report No. 36/78.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Choudum, S.A. (1981). Characterization of forcibly outerplanar graphic sequences. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092264
Download citation
DOI: https://doi.org/10.1007/BFb0092264
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