The circular chromatic index of graphs of high girth
From MaRDI portal
(Redirected from Publication:858677)
Recommendations
Cites work
- 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?)
- A condition for matchability in hypergraphs
- A note on the star chromatic number
- A revival of the girth conjecture
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Circular chromatic number: A survey
- Combinatorics 79. Part I
- Domination numbers and homology
- Hall's theorem for hypergraphs
- High-girth graphs avoiding a minor are nearly bipartite
- 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 Factorization of Linear Graphs
- The clique complex and hypergraph matching
- Transversals of Vertex Partitions in Graphs
- Triangulated spheres and colored cliques
Cited in
(16)- Circular chromatic index of Cartesian products of graphs
- Constructing graphs with no independent transversals
- Ring graphs and Goldberg's bound on chromatic index
- A note on circular chromatic number of graphs with large girth and similar problems
- Circular edge-colorings of cubic graphs with girth six
- The circular chromatic index of some Class 2 graphs
- Graphs of large girth with prescribed partial circular colourings
- A revival of the girth conjecture
- Circular chromatic index of graphs of maximum degree 3
- The circular chromatic index
- Circular chromatic indices of regular graphs
- Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs
- Circular chromatic indices of even degree regular graphs
- Circular edge-colorings of cubic graphs with girth six
- Circular total chromatic numbers of graphs
- Finding independent transversals efficiently
This page was built for publication: The circular chromatic index of graphs of high girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858677)