Skip to main content
SpringerLink
Log in

On the density and chromatic numbers of graphs

  • Conference paper
  • First Online:
The Many Facets of Graph Theory

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

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
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. C. Berge, Some classes of perfect graphs, Graph Theory and Theoretical Physics (edited by F. Harary) Academic Press (1967), 155–165.

    Google Scholar 

  2. H.J. Finck, On the chromatic numbers of a graph and its complement, Theory of Graphs (edited by P. Erdös and G. Katona) Academic Press (1968), 99–113.

    Google Scholar 

  3. R.E. Greenwood and A.M. Gleason, Combinatorial relations and chromatic graphs, Canad. J. Math. 7, no. 1 (1955), 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  4. J.B. Kalbfleisch, Upper bounds for some Ramsey numbers, Journal of Combinatorial Theory, 2 (1967), 35–42.

    Article  MathSciNet  MATH  Google Scholar 

  5. E.A. Nordhaus and J.W. Gaddum, On complementary graphs, Amer. Math. Monthly 63 (1956), 176–177.

    Article  MathSciNet  MATH  Google Scholar 

  6. O. Ore, Theory of Graphs, Amer. Math. Society Colloq. Publications, vol. 38, 1962.

    Google Scholar 

  7. B.M. Stewart, On a theorem of Nordhaus and Gaddum, J. Combinatorial Theory, 6 (1969), 217–218.

    Article  MathSciNet  MATH  Google Scholar 

  8. A.A. Zykov, On some properties of linear complexes, Math. Sbornik 24 (1949), 163–188. [Amer. Math. Society Translations No. 79, 1952].

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Michigan State University, USA

    E. A. Nordhaus

Authors
  1. E. A. Nordhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Chartrand S. F. Kapoor

Rights and permissions

Reprints and permissions

Copyright information

© 1969 Springer-Verlag

About this paper

Cite this paper

Nordhaus, E.A. (1969). On the density and chromatic numbers of graphs. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060124

Download citation

  • DOI: https://doi.org/10.1007/BFb0060124

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04629-5

  • Online ISBN: 978-3-540-36161-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation