Skip to main content
    • Aa
    • Aa

On circuits and subgraphs of chromatic graphs

  • P. Erdös (a1)

A graph is said to be k-chromatic if its vertices can be split into k classes so that two vertices of the same class are not connected (by an edge) and such a splitting is not possible for k−1 classes. Tutte was the first to show that for every k there is a k-chromatic graph which contains no triangle [1].

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

2. J. B. Kelly and L. M. Kelly , “Paths and circuits in critical graphs”, American J. of Math., 76 (1954), 786792.

3. P. Erdös , “Graph theory and probability”, Canadian J. of Math., 11 (1959), 3438.

5. P. Erdös and G. Szekeres , “Graph theory and probability (II)”, Canadian J. of Math., 13 (1961), 346352.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

  • ISSN: 0025-5793
  • EISSN: 2041-7942
  • URL: /core/journals/mathematika
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 3 *
Loading metrics...

Abstract views

Total abstract views: 46 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 27th May 2017. This data will be updated every 24 hours.