Ore's conjecture on color-critical graphs is almost true (Q462926): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new proof of Grünbaum's 3 color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs of coloring theorems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map Colour Theorems Related To the Heawood Colour Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-density of 4-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type versions of Brooks' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in colour-critical graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A list version of Dirac's theorem on the number of edges in colour-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the number of edges in colour-critical graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore's conjecture for \(k=4\) and Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with chromatic number close to maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal number of edges in color-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short list color proof of Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3990593 / rank
 
Normal rank

Latest revision as of 05:33, 9 July 2024

scientific article
Language Label Description Also known as
English
Ore's conjecture on color-critical graphs is almost true
scientific article

    Statements

    Ore's conjecture on color-critical graphs is almost true (English)
    0 references
    22 October 2014
    0 references
    graph coloring
    0 references
    \(k\)-critical graphs
    0 references
    sparse graphs
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references