Density of 5/2-critical graphs

DOI10.1007/s00493-016-3356-3zbMath1399.05072arXiv1411.6668OpenAlexW1609788678MaRDI QIDQ1705839

Luke Postle, Zdeněk Dvořák

Publication date: 16 March 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.6668

zbMATH Keywords

criticalitycircular chromatic numbergirthgraph homomorphismplanar graphprojective-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Packing spanning trees in highly essentially connected graphs ⋮ On the density of \(C_7\)-critical graphs ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem ⋮ Fractional coloring planar graphs under Steinberg-type conditions ⋮ Homomorphisms to small negative even cycles ⋮ Circular chromatic number of signed graphs ⋮ Circular Flows in Planar Graphs ⋮ Density of \(C_{-4}\)-critical signed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Ore's conjecture for \(k=4\) and Grötzsch's theorem
• Homomorphisms from sparse graphs with large girth.
• Circular \((5,2)\)-coloring of sparse graphs
• Star chromatic number
• (2 + ?)-Coloring of planar graphs with large odd-girth
• Circular chromatic number: A survey
• Circular chromatic number of planar graphs of large odd girth

This page was built for publication: Density of 5/2-critical graphs