Short proofs of coloring theorems on planar graphs (Q2441638): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4065568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797465 / rank
 
Normal rank
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: Colorings of plane graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without adjacent cycles of length at most seven are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorable planar graphs without short cycles / 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: Grötzsch's theorem on 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of B. Grünbaum / rank
 
Normal rank
Property / cites work
 
Property / cites work: The color space of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / 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: Ore's conjecture on color-critical graphs is almost true / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorable planar graphs without cycles of four lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring Klein bottle graphs of girth five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorable planar graphs without prescribed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 4, 6, 8-cycles are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorability of planar graphs without adjacent short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorable plane graphs without 5- and 7-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-chromatic projective graphs / rank
 
Normal rank

Latest revision as of 12:02, 7 July 2024

scientific article
Language Label Description Also known as
English
Short proofs of coloring theorems on planar graphs
scientific article

    Statements

    Short proofs of coloring theorems on planar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    planar triangle-free graph
    0 references
    3-colorable
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers