The circular chromatic number of induced subgraphs
From MaRDI portal
(Redirected from Publication:1880798)
For positive integers \(d\) and \(k\), \(k\geq 2d\), a \((k, d)\)-coloring of a graph \(G\) is a mapping \(f: V(G) \rightarrow \{0, \dots, k-1\}\) such that, for every adjacent vertices \(x, y\) of \(G\), \(d\leq | f(x) - f(y)| \leq k - d\). The circular chromatic number of \(G\) is \(\chi_c(G) =\min\{\frac{k}{d} : G \text{ admits a }(k, d)\)-coloring
Recommendations
Cites work
- A note on the star chromatic number
- Circular chromatic number of subgraphs
- Circular chromatic number: A survey
- Coloring-flow duality of embedded graphs
- On (k,d)-colorings and fractional nowhere-zero flows
- Some theorems concerning the star chromatic number of a graph
- Star chromatic number
- Star chromatic numbers and products of graphs
Cited in
(8)- An analogue of Hajós' theorem for the circular chromatic number. II
- Circular colouring and orientation of graphs
- scientific article; zbMATH DE number 6612443 (Why is no real title available?)
- scientific article; zbMATH DE number 2170470 (Why is no real title available?)
- Some results on circular chromatic number of a graph
- Circular chromatic number: A survey
- Construction of sparse graphs with prescribed circular colorings
- An analogue of Dirac's theorem on circular super-critical graphs
This page was built for publication: The circular chromatic number of induced subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1880798)
