On the density of \(C_7\)-critical graphs

DOI10.1007/s00493-020-4177-yOpenAlexW4213231076MaRDI QIDQ2151187

Evelyne Smith-Roberge, Luke Postle

Publication date: 30 June 2022

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

homomorphismplanar graphcritical graph

Mathematics Subject Classification ID

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

Related Items (6)

Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ A density bound for triangle‐free 4‐critical graphs ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem ⋮ Homomorphisms to small negative even cycles ⋮ Circular Flows in Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Ore's conjecture on color-critical graphs is almost true
• Homomorphisms from sparse graphs with large girth.
• Density of 5/2-critical graphs
• Counterexamples to Jaeger's circular flow conjecture
• Note on the colouring of graphs
• (2 + ?)-Coloring of planar graphs with large odd-girth
• Circular Flows in Planar Graphs
• Circular chromatic number: A survey
• Circular chromatic number of planar graphs of large odd girth

This page was built for publication: On the density of \(C_7\)-critical graphs