The following pages link to Coloring powers and girth (Q2827489):
Displaying 6 items.
- On colorings of graph powers (Q1043947) (← links)
- On small graphs with highly imperfect powers (Q1198509) (← links)
- Distance colouring without one cycle length (Q1689995) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- Distance Colouring Without One Cycle Length (Q4962592) (← links)
- $t$-Strong Cliques and the Degree-Diameter Problem (Q5020846) (← links)