A revival of the girth conjecture

DOI10.1016/J.JCTB.2004.04.003MaRDI QIDQ1880788zbMATH OpenOpenAlexWikidataFDO

Authors Tomáš Kaiser, Daniel Král', 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

circular chromatic indexcoloringcubic bridgeless graphgirth conjecturesnarks

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Circular edge-colorings of cubic graphs with girth six
• Snarks without small cycles
• The circular chromatic index of graphs of high girth
• Asymptotic lower bounds on circular chromatic index of snarks
• Circular chromatic number of planar graphs of large odd girth

Cites work

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

Cited in

(13)

• Snarks without small cycles
• Asymptotic lower bounds on circular chromatic index of snarks
• Circular chromatic indices of even degree regular graphs
• \(k\)-regular graphs with the circular chromatic index close to \(k\)
• The circular chromatic index of Goldberg snarks
• Covering cubic graphs with matchings of large size
• Cubic graphs with given circular chromatic index
• Finding independent transversals efficiently
• scientific article; zbMATH DE number 5038481 (Why is no real title available?)
• Circular chromatic indices of regular graphs
• Circular edge-colorings of cubic graphs with girth six
• Circular edge-colorings of cubic graphs with girth six
• The circular chromatic index of graphs of high girth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1880788)