Skip to main content

2-2 Perfect graphic degree sequences

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorics and Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 885))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Behzad and G. Chartrand, No graph is perfect, Amer. Math. Monthly, 74 (1967), 962–963.

    Article  MathSciNet  MATH  Google Scholar 

  2. V. Bhat, Characterization of 3-perfect graphical degree seq., Proc. Ind. Nat. Sci. Acad, 41 (1975), 228–244.

    MathSciNet  MATH  Google Scholar 

  3. P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok, 11 (1960), 264–274.

    MATH  Google Scholar 

  4. D.J. Kleitman and D.L. Wang, Algorithms for constructing graphs and digraphs with given valences and factors, Discrete Math., 6 (1973), 79–88.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Siddani Bhaskara Rao

Rights and permissions

Reprints 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

Publish with us

Policies and ethics