Pages that link to "Item:Q4243353"
From MaRDI portal
The following pages link to Circular colouring and graph homomorphism (Q4243353):
Displaying 14 items.
- A dichotomy theorem for circular colouring reconfiguration (Q301588) (← links)
- On defining numbers of circular complete graphs (Q864158) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- On sparse graphs with given colorings and homomorphisms. (Q1425116) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
- (Q3429566) (← links)
- (Q4221701) (← links)
- (Q4783168) (← links)
- The circular chromatic number of series-parallel graphs with large girth (Q4948748) (← links)
- (Q5284584) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ (Q6093150) (← links)