Gaps in the chromatic spectrum of face-constrained plane graphs
From MaRDI portal
Publication:5934765
zbMath0984.05036MaRDI QIDQ5934765
Publication date: 15 May 2001
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121761
chromatic spectrum; colorability; colorings of hypergraphs; mixed hypergraphs; planar graphs and hypergraphs
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Mixed hypergraphs and beyond, WORM colorings of planar graphs, Looseness of plane graphs, Coloring face hypergraphs on surfaces, The smallest one-realization of a given set. III, Color-bounded hypergraphs, IV: Stable colorings of hypertrees, On maximum face-constrained coloring of plane graphs with no short face cycles., More results on the smallest one-realization of a given set. II, Facially-constrained colorings of plane graphs: a survey, The smallest uniform color-bounded hypergraphs which are one-realizations of a given set, Coloring mixed hypertrees, Non-rainbow colorings of 3-, 4- and 5-connected plane graphs