Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4000782 / 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: Q4812233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4811813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4797463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable / 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 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: A sufficient condition for planar graphs to be 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with fixed genus and girth / 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: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the three color problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / 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: A 3-color theorem on plane graphs without 5-circuits / rank
 
Normal rank

Latest revision as of 09:00, 3 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
scientific article

    Statements

    Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (English)
    0 references
    18 October 2010
    0 references
    0 references
    graph
    0 references
    planar graph
    0 references
    3-coloring
    0 references
    0 references
    0 references
    0 references