Recommendations
Cites work
Cited in
(22)- An analogue of Hajós' theorem for the circular chromatic number. II
- The circular chromatic number of induced subgraphs
- On the circular chromatic number of graph powers
- Chromatic number of circulant graph \(C_{n+1}\langle 1, 3\rangle\) after subdividing all or some of its edges
- On the circular chromatic number of deleted vertex subgraphs
- scientific article; zbMATH DE number 2058681 (Why is no real title available?)
- scientific article; zbMATH DE number 2061801 (Why is no real title available?)
- Nearly nowhere-zero \(r\)-flow graphs
- scientific article; zbMATH DE number 1782859 (Why is no real title available?)
- Circular chromatic number of induced subgraphs of Kneser graphs
- scientific article; zbMATH DE number 1420226 (Why is no real title available?)
- The round-up property of the fractional chromatic number for proper circular arc graphs
- Circular chromatic Ramsey number
- Circular chromatic number and edge-path replacement graph.
- scientific article; zbMATH DE number 2192158 (Why is no real title available?)
- On the circular chromatic number of circular partitionable graphs
- Circular chromatic number and Mycielski graphs
- Circular chromatic number and graph minors
- Circular chromatic number: A survey
- Indicated coloring of some families of graphs
- An analogue of Dirac's theorem on circular super-critical graphs
- Multicoloring and Mycielski construction
This page was built for publication: Circular chromatic number of subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432769)
