Skip to main content

On graphs having prescribed clique number, chromatic number, and maximum degree

  • 1437 Accesses

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

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   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.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. B. Andrasfai, P. Erdös, and V. Sós, "On the connection between chromatic number, maximal clique, and minimal degree of a graph," Discrete Math. 8(1974), 205–218.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. M. Behzad and G. Chartrand, Introduction to the Theory of Graphs, Allyn and Bacon, Boston (1972).

    Google Scholar 

  3. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam (1973).

    MATH  Google Scholar 

  4. R. L. Brooks, "On colouring the nodes of a network," Proc. Cambridge Philos. Soc. 37(1941), 194–197.

    CrossRef  MathSciNet  Google Scholar 

  5. P. Catlin, "A bound on the chromatic number of graphs." (To appear.)

    Google Scholar 

  6. V. Chvátal, "The minimality of the Mycielski graph," Graphs and Combinatorics, Springer-Verlag, Berlin (1974), 243–246.

    CrossRef  Google Scholar 

  7. V. Chvátal, "The smallest triangle-free 4-chromatic 4-regular graph," J. Combinatorial Theory 9(1970), 93–94.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. D. Geller and S. Stahl, "The chromatic number and other functions of the lexicographic product," J. Combinatorial Theory 19B (1975), 87–95.

    MathSciNet  Google Scholar 

  9. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., (1969).

    Google Scholar 

  10. L. Lovász, "Normal hypergraphs and the perfect graph conjecture," Discrete Math, 2(1974), 253–267.

    CrossRef  Google Scholar 

  11. J. Mycielski, "Sur le coloriage des graphs," Colloq. Math. 3(1955), 161–162.

    MathSciNet  MATH  Google Scholar 

  12. D. Seinsche, "On a property of the class of n-colorable graphs," J. Combinatorial Theory 16B (1974), 191–193.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benedict, J.M., Chinn, P.Z. (1978). On graphs having prescribed clique number, chromatic number, and maximum degree. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070370

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive