The circular chromatic number of series-parallel graphs with large girth
From MaRDI portal
Publication:4948748
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 1309148 (Why is no real title available?)
- scientific article; zbMATH DE number 927067 (Why is no real title available?)
- A note on the star chromatic number
- A simple proof of Moser's theorem
- Acyclic graph coloring and the complexity of the star chromatic number
- Circular colouring and graph homomorphism
- Girth in graphs
- Graph Theory and Probability
- Planar graphs with circular chromatic numbers between 3 and 4
- Star chromatic number
- Star chromatic numbers and products of graphs
- Star chromatic numbers of graphs
- The star chromatic number of a graph
- The star-chromatic number of planar graphs
Cited in
(9)- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- scientific article; zbMATH DE number 1420226 (Why is no real title available?)
- Density of the circular chromatic numbers of series-parallel graphs
- Fractional, circular, and defective coloring of series-parallel graphs
- Circular chromatic number of planar graphs of large odd girth
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- A note on circular chromatic number of graphs with large girth and similar problems
- The circular chromatic number of series-parallel graphs of large odd girth
- Short proofs for two theorems of Chien, Hell and Zhu
This page was built for publication: The circular chromatic number of series-parallel graphs with large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948748)