A relaxation of the Bordeaux conjecture (Q2349972): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Colorings of plane graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4811813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs with neither 5-cycles nor close 3-cycles 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: A sufficient condition for planar graphs to be 3-colorable / 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: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relaxation of Steinberg's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-color theorem on plane graphs without 5-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $(3,1)^*$-Coloring of Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable / rank
 
Normal rank

Latest revision as of 05:41, 10 July 2024

scientific article
Language Label Description Also known as
English
A relaxation of the Bordeaux conjecture
scientific article

    Statements

    Identifiers