Irreducible 4-critical triangle-free toroidal graphs

DOI10.1016/j.endm.2017.06.063zbMath1378.05056arXiv1801.10457OpenAlexW2962855123MaRDI QIDQ5915812

Jakub Pekárek, Zdeněk Dvořák

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics, European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graph coloringtoroidal graphstriangle-free graphsembedded graphs4-critical triangle-free toroidal graphs

Mathematics Subject Classification ID

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

Related Items (3)

Characterization of 4-critical triangle-free toroidal graphs ⋮ Coloring near-quadrangulations of the cylinder and the torus ⋮ Irreducible 4-critical triangle-free toroidal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Five-coloring graphs on the Klein bottle
• Coloring even-faced graphs in the torus and the Klein bottle
• The non-existence of colorings
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Five-coloring graphs on the torus
• Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
• The four-colour theorem
• Color-critical graphs on a fixed surface
• The chromatic number of a graph of girth 5 on a fixed surface
• Diameter and treewidth in minor-closed graph families
• Three-coloring Klein bottle graphs of girth five
• Coloring graphs with fixed genus and girth
• Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces
• 4-chromatic projective graphs
• 6-Critical Graphs on the Klein Bottle
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Map-Colour Theorems
• Irreducible 4-critical triangle-free toroidal graphs

This page was built for publication: Irreducible 4-critical triangle-free toroidal graphs