Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.

DOI10.1016/J.JCTB.2016.04.003zbMATH Open1337.05039DBLPjournals/jct/DvorakKT16arXiv1010.2472OpenAlexW2129440822WikidataQ57601328 ScholiaQ57601328MaRDI QIDQ290801FDOQ290801

Daniel Král', Robin Thomas, Zdeněk Dvořák

Publication date: 3 June 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Abstract: Let G be a plane graph with exactly one triangle T and all other cycles of length at least 5, and let C be a facial cycle of G of length at most six. We prove that a 3-coloring of C does not extend to a 3-coloring of G if and only if C has length exactly six and there is a color x such that either G has an edge joining two vertices of C colored x, or T is disjoint from C and every vertex of T is adjacent to a vertex of C colored x. This is a lemma to be used in a future paper of this series.

Full work available at URL: https://arxiv.org/abs/1010.2472

Recommendations

• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
• 3-coloring triangle-free planar graphs with a precolored 9-cycle
• On 3-colorings of plane graphs
• 3-coloring triangle-free planar graphs with a precolored 9-cycle
• 3-coloring triangle-free planar graphs with a precolored 9-cycle

zbMATH Keywords

graph coloringplanar graphsprecoloring extension

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Title not available (Why is that?)
• The four-colour theorem
• Color-critical graphs on a fixed surface
• Title not available (Why is that?)
• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
• Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
• The non-existence of colorings
• Five-coloring graphs on the torus
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• The chromatic number of a graph of girth 5 on a fixed surface
• A short list color proof of Grötzsch's theorem
• Three-coloring Klein bottle graphs of girth five
• 3-list-coloring planar graphs of girth 5
• Grötzsch's theorem on 3-colorings
• Title not available (Why is that?)
• Three-coloring triangle-free planar graphs in linear time
• Title not available (Why is that?)
• Every Planar Map is Four Colorable
• Title not available (Why is that?)
• Coloring graphs with fixed genus and girth
• 4-chromatic projective graphs
• 6-Critical Graphs on the Klein Bottle
• On a conjecture of B. Grünbaum
• Map-Colour Theorems
• Five-coloring graphs on the Klein bottle
• On 3-colorable plane graphs without 5- and 7-cycles

Cited In (9)

• Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable
• Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
• Note on 3-choosability of planar graphs with maximum degree 4
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
• 3-coloring triangle-free planar graphs with a precolored 9-cycle
• Triangle-free planar graphs with small independence number
• Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies
• Title not available (Why is that?)
• 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle

This page was built for publication: Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290801)