A sufficient condition for planar graphs to be 3-colorable (Q1405097): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / 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: 25 pretty graph colouring problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3139765 / rank | |||
Normal rank |
Revision as of 10:20, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A sufficient condition for planar graphs to be 3-colorable |
scientific article |
Statements
A sufficient condition for planar graphs to be 3-colorable (English)
0 references
25 August 2003
0 references
The authors prove that every proper 3-coloring of a face of size 3 or 7 in a connected planar graph without pairs of 3-cycles at distance less than 4 and without 5-cycles can be extended to a proper 3-coloring of the whole graph. Form this and Grötzsch's theorem, it follows that planar graphs without 3-cycles at distance less than 4 and without 5-cycles are 3-colorable. The authors conjecture that planar graphs without 5-cycles in which every two 3-cycles are vertex-disjoint (or every two 3-cycles are edge-disjoint) are 3-colorable.
0 references
graph coloring
0 references