The circular chromatic index of graphs of high girth
From MaRDI portal
Publication:858677
DOI10.1016/j.jctb.2006.03.002zbMath1114.05036OpenAlexW2047918966WikidataQ57601523 ScholiaQ57601523MaRDI QIDQ858677
Tomáš Kaiser, Xuding Zhu, Riste Škrekovski, Daniel Král'
Publication date: 11 January 2007
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.2006.03.002
Related Items (6)
Circular edge-colorings of cubic graphs with girth six ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ Finding independent transversals efficiently ⋮ Circular Chromatic Indices of Regular Graphs ⋮ Neighbor-distinguishing \(k\)-tuple edge-colorings of 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 I
- Domination numbers and homology
- High-girth graphs avoiding a minor are nearly bipartite
- Triangulated spheres and colored cliques
- A revival of the girth conjecture
- A condition for matchability in hypergraphs
- Snarks without small cycles
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- 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
- The Factorization of Linear Graphs
- Circular chromatic number: A survey
This page was built for publication: The circular chromatic index of graphs of high girth