The following pages link to Star chromatic numbers of graphs (Q2563519):
Displayed 14 items.
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Some theorems concerning the star chromatic number of a graph (Q1362095) (← links)
- Some star extremal circulant graphs (Q1408873) (← links)
- Resource-sharing system scheduling and circular chromatic number (Q1770401) (← links)
- A revival of the girth conjecture (Q1880788) (← links)
- Minimally circular-imperfect graphs with a major vertex (Q2581632) (← links)
- An analogue of Hajós’ Theorem for the circular chromatic number (Q2723478) (← links)
- (Q3305219) (← links)
- Circular colouring and graph homomorphism (Q4243353) (← links)
- (Q4944681) (← links)
- The circular chromatic number of series-parallel graphs with large girth (Q4948748) (← links)