Coloring near-quadrangulations of the cylinder and the torus

DOI10.1016/j.ejc.2020.103258zbMath1458.05063arXiv1909.12015OpenAlexW3100062452MaRDI QIDQ2225450

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

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

3-colorability of triangle-free embedded graphstorus-realizable multisets

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Characterization of 4-critical triangle-free toroidal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
• Coloring even-faced graphs in the torus and the Klein bottle
• A short proof of the two-commodity flow theorem
• 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
• Three-coloring Klein bottle graphs of girth five
• 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle
• Coloring graphs with fixed genus and girth
• Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces
• List-coloring embedded graphs
• A Contribution to the Theory of Chromatic Polynomials
• Irreducible 4-critical triangle-free toroidal graphs

This page was built for publication: Coloring near-quadrangulations of the cylinder and the torus