Skip to main content
Log in

Size, chromatic number, and connectivity

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We consider the minimum number of edges in ak-edge-connected graph of ordern with chromatic number at leastc, obtaining the optimal bounds in most cases.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, 1976

  2. Dirac, G.A.: The structure ofk-chromatic graphs, Fund. Math.40, 42–55 (1953)

    MATH  MathSciNet  Google Scholar 

  3. Dirac, G.A.: A theorem of R.L. Brooks and a conjecture of H. Hadwiger, Proc. Lond. Math. Soc.17, 161–195(1957)

    Article  MathSciNet  Google Scholar 

  4. Dirac, G.A.: The number of edges in critical graphs, J. Reine Angew Math.268/269, 150–164(1974)

    MathSciNet  Google Scholar 

  5. Harary, F.: The maximum connectivity of a graph, Proc. Nat. Acad. Sci. U.S.A.48, 1142–1146(1962)

    Article  MATH  MathSciNet  Google Scholar 

  6. Toft, Graph colouring theory, Handbook of Combinatorics, (to be published)

  7. Tomescu, I.: R. Acad. Sci. Paris A272 (1971), 1301–1303

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bhasker, J., Samad, T. & West, D.B. Size, chromatic number, and connectivity. Graphs and Combinatorics 10, 209–213 (1994). https://doi.org/10.1007/BF02986667

Download citation

  • Issue Date:

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

Keywords

Navigation