The circular chromatic number of series-parallel graphs with large girth
From MaRDI portal
Publication:4948748
DOI10.1002/(SICI)1097-0118(200004)33:4%3C185::AID-JGT1%3E3.0.CO;2-NzbMATH Open0944.05038OpenAlexW4240126258MaRDI QIDQ4948748FDOQ4948748
Publication date: 15 September 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200004)33:4%3C185::aid-jgt1%3E3.0.co;2-n
Recommendations
Cites Work
- Title not available (Why is that?)
- Graph Theory and Probability
- Star chromatic number
- Star chromatic numbers and products of graphs
- Circular colouring and graph homomorphism
- Acyclic graph coloring and the complexity of the star chromatic number
- Title not available (Why is that?)
- A note on the star chromatic number
- Girth in graphs
- Title not available (Why is that?)
- Planar graphs with circular chromatic numbers between 3 and 4
- The star-chromatic number of planar graphs
- Star chromatic numbers of graphs
- The star chromatic number of a graph
- A simple proof of Moser's theorem
Cited In (7)
- Short proofs for two theorems of Chien, Hell and Zhu
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Circular chromatic number of planar graphs of large odd girth
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- Title not available (Why is that?)
- The circular chromatic number of series-parallel graphs of large odd girth
- Density of the circular chromatic numbers of series-parallel graphs
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)
