The following pages link to On N2-vertex coloring of graphs (Q4603874):
Displaying 7 items.
- On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\) (Q875716) (← links)
- On the parameter \(v_ 2(h)\) for \(L_ 2\)-coloured graphs (Q1100214) (← links)
- On \(\mathrm{M}_f\)-edge colorings of graphs (Q2158189) (← links)
- \(F\)-WORM colorings: results for 2-connected graphs (Q2403800) (← links)
- (Q4391697) (← links)
- Colorings of the Graph K ᵐ 2 + Kn (Q5859213) (← links)
- Tight bounds for the \(N_2\)-chromatic number of graphs (Q6563257) (← links)