Pages that link to "Item:Q3159379"
From MaRDI portal
The following pages link to On the complexity of the circular chromatic number (Q3159379):
Displaying 12 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- Circular coloring of graphs via linear programming and tabu search (Q302132) (← links)
- Hardness of computing clique number and chromatic number for Cayley graphs (Q518185) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- On the restricted homomorphism problem (Q948709) (← links)
- Describing hereditary properties by forbidden circular orderings (Q2096309) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- Graphs with chromatic numbers strictly less than their colouring numbers (Q3119055) (← links)
- (Q3980548) (← links)
- (Q4414494) (← links)
- Circular chromatic number of induced subgraphs of Kneser graphs (Q4615060) (← links)
- On the hardness of approximating the chromatic number (Q5932643) (← links)