Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
From MaRDI portal
Publication:6251001
DOI10.1016/J.JCTB.2020.09.001arXiv1404.6356MaRDI QIDQ6251001
Zdeněk Dvořák, Daniel Král', Robin Thomas
Publication date: 25 April 2014
Abstract: Let G be a 4-critical graph with t triangles, embedded in a surface of genus g. Let c be the number of 4-cycles in G that do not bound a 2-cell face. We prove that the sum of lengths of (>=5)-faces of G is at most linear in g+t+c-1.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
This page was built for publication: Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6251001)
