Girth and fractional chromatic number of planar graphs

DOI10.1002/jgt.10024zbMath1176.05028OpenAlexW4239687444MaRDI QIDQ3651181

Amir Pirnazar, Daniel H. Ullman

Publication date: 8 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10024

zbMATH Keywords

upper boundlower boundchromatic numberfractional analoguegirth 4panar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (7)

Graph Information Ratio ⋮ Independent sets in triangle-free cubic planar graphs ⋮ Homomorphisms from sparse graphs to the Petersen graph ⋮ Large Independent Sets in Triangle-Free Planar Graphs ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable ⋮ On the Circular Chromatic Number of Graph Powers

This page was built for publication: Girth and fractional chromatic number of planar graphs