A revival of the girth conjecture

DOI10.1016/j.jctb.2004.04.003zbMath1052.05030OpenAlexW2013273488WikidataQ57601574 ScholiaQ57601574MaRDI QIDQ1880788

Daniel Král', Tomáš Kaiser, Riste Škrekovski

Publication date: 1 October 2004

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.04.003

zbMATH Keywords

coloringsnarksgirth conjecturecircular chromatic indexcubic bridgeless graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

The circular chromatic index of graphs of high girth ⋮ \(k\)-regular graphs with the circular chromatic index close to \(k\) ⋮ Asymptotic lower bounds on circular chromatic index of snarks ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ The circular chromatic index of Goldberg snarks ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ Finding independent transversals efficiently ⋮ Circular Chromatic Indices of Regular Graphs ⋮ Circular chromatic indices of even degree regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique complex and hypergraph matching
• Combinatorics 79. Part II
• Domination numbers and homology
• High-girth graphs avoiding a minor are nearly bipartite
• Triangulated spheres and colored cliques
• A condition for matchability in hypergraphs
• Snarks without small cycles
• Independent systems of representatives in weighted graphs
• Star chromatic numbers of graphs
• A note on the star chromatic number
• Star chromatic number
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Hall's theorem for hypergraphs
• Transversals of Vertex Partitions in Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Circular chromatic number: A survey

This page was built for publication: A revival of the girth conjecture