Coloring graphs without short non-bounding cycles

DOI10.1006/jctb.1994.1018zbMath0793.05058OpenAlexW1980277139MaRDI QIDQ1322020

Steve Fisk, Bojan Mohar

Publication date: 10 August 1994

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

Full work available at URL: https://doi.org/10.1006/jctb.1994.1018

zbMATH Keywords

cyclechromatic numbersurfaceslocally planar graphsmap coloringcoloring graphs

Mathematics Subject Classification ID

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

Related Items (16)

Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ The chromatic number of a graph of girth 5 on a fixed surface ⋮ Coloring graphs with fixed genus and girth ⋮ Locally planar graphs are 5-choosable ⋮ Acyclic colorings of locally planar graphs ⋮ Online coloring graphs with high girth and high odd girth ⋮ What is on his mind? ⋮ On the critical point-arboricity graphs ⋮ Families of dot-product snarks on orientable surfaces of low genus ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ Coloring-flow duality of embedded graphs ⋮ Unnamed Item ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs ⋮ Coloring locally bipartite graphs on surfaces. ⋮ Coloring face-hypergraphs of graphs on surfaces

This page was built for publication: Coloring graphs without short non-bounding cycles