Skip to main content

Graphical theorems of the Nordhaus-Gaddum class

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

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Alavi and M. Behzad, "Complementary Graphs and Edge Chromatic Numbers", J. SIAM Appl. Math. (to appear).

    Google Scholar 

  2. Y. Alavi and J. Mitchem, "Connectivity and Line-Connectivity of Complementary Graphs", (this volume).

    Google Scholar 

  3. M. Behzad, Graphs and Their Chromatic Numbers, Doctoral thesis, Michigan State University, 1965.

    Google Scholar 

  4. G.A. Dirac, "Graph Union and Chromatic Number", J. London Math. Soc., 39 (1964), 451–454.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. H.J. Finck, "On the Chromatic Numbers of a Graph and its Complement", Theory of Graphs (P. Erdos and G. Katona, eds.) Academic Press (1968), 99–113.

    Google Scholar 

  6. D. Geller and S. Hedetniemi, "A Proof Technique in Graph Theory", Proof Techniques in Graph Theory (F. Harary, ed.) Academic Press (1969), 49–59.

    Google Scholar 

  7. R.P. Gupta, "Bounds on the Chromatic and Achromatic Numbers of Complementary Graphs", Recent Progress in Combinatorics (W.T. Tutte, ed.) Academic Press (1969), 229–235.

    Google Scholar 

  8. F. Harary and S. Hedetniemi, "The Achromatic Number of a Graph", J. Combinatorial Theory, 8 (1970), 154–161.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. S. Hedetniemi, "Homomorphisms of Graphs and Automata", University of Michigan, Tech. Rept., pp. 24–25. Ann Arbor, Michigan (1966).

    Google Scholar 

  10. D.R. Lick and A.T. White, "k-Degenerate Graphs", Canad. J. Math. (to appear).

    Google Scholar 

  11. D.R. Lick and A.T. White, "Point Partition Numbers of Graphs and Their Complements", (in preparation).

    Google Scholar 

  12. J. Mitchem, On Extremal Partitions of Graphs, Doctoral Thesis, Western Michigan University, 1970.

    Google Scholar 

  13. E.A. Nordhaus and J.W. Gaddum "On Complementary Graphs", Amer. Math. Monthly, 63 (1956), 175–177.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. G. Szekeres and H.S. Wilf, "An Inequality for the Chromatic Number of a Graph", J. Combinatorial Theory, 4 (1968), 1–3.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. V.G. Vizing, "On an Estimate of the Chromatic Class of a p-Graph", (Russian), Diskret. Analiz. 3 (1964), 25–30.

    MathSciNet  Google Scholar 

  17. V.G. Vizing, "The Chromatic Class of a Multigraph", Cybernetics, 1 (1965), No. 3. 32–41.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Additional information

Dedicated to Professor E.A. Nordhaus, Michigan State University

Rights and permissions

Reprints and Permissions

Copyright information

© 1971 Springer-Verlag

About this paper

Cite this paper

Chartrand, G., Mitchem, J. (1971). Graphical theorems of the Nordhaus-Gaddum class. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059422

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05386-6

  • Online ISBN: 978-3-540-36508-2

  • eBook Packages: Springer Book Archive