Pages that link to "Item:Q1045059"
From MaRDI portal
The following pages link to On the chromatic number of circulant graphs (Q1045059):
Displaying 14 items.
- Chromatic number of Harary graphs (Q301848) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- On the chromatic number of integral circulant graphs (Q604055) (← links)
- The lonely runner problem for lacunary sequences (Q1709528) (← links)
- Vertex-colouring of 3-chromatic circulant graphs (Q2012064) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- On the time for a runner to get lonely (Q2159728) (← links)
- The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ (Q2958104) (← links)
- Some remarks on the lonely runner conjecture (Q3120645) (← links)
- Perfect 1-Factorizations of a Family of Cayley Graphs (Q3465907) (← links)
- Regular chromatic number and the lonely runner problem (Q3503506) (← links)
- Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem (Q5048455) (← links)
- Lonely Runner Polyhedra (Q5383284) (← links)
- Chromatic numbers of Cayley graphs of abelian groups: a matrix method (Q6178783) (← links)
