Circular chromatic number of planar graphs of large odd girth
From MaRDI portal
Publication:5936672
zbMath0969.05022MaRDI QIDQ5936672
Publication date: 9 July 2001
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/121227
Related Items (12)
Homomorphism bounded classes of graphs ⋮ Fractional DP-chromatic number of planar graphs of large girth ⋮ On the density of \(C_7\)-critical graphs ⋮ Fractional coloring planar graphs under Steinberg-type conditions ⋮ Homomorphisms to small negative even cycles ⋮ Density of 5/2-critical graphs ⋮ Homomorphisms from sparse graphs with large girth. ⋮ Homomorphisms of signed graphs: an update ⋮ Circular consecutive choosability of k-choosable graphs ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Homomorphisms from sparse graphs to the Petersen graph ⋮ Circular choosability
This page was built for publication: Circular chromatic number of planar graphs of large odd girth
