The following pages link to On colorings of graph powers (Q1043947):
Displaying 19 items.
- Dynamic coloring of graphs having no \(K_5\) minor (Q277625) (← links)
- Clawfreeness of the powers of a graph (Q423974) (← links)
- On the two largest distance eigenvalues of graph powers (Q503610) (← links)
- On \(b\)-coloring of powers of hypercubes (Q528557) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← links)
- On colorings of graph fractional powers (Q968432) (← links)
- On the least distance eigenvalues of the second power of a graph (Q1786948) (← links)
- The chromatic number of the product of 14-chromatic graphs can be 13 (Q2151188) (← links)
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture (Q2338641) (← links)
- On the odd girth and the circular chromatic number of generalized Petersen graphs (Q2359794) (← links)
- On the circular chromatic number of graph powers (Q2874089) (← links)
- High-girth cubic graphs are homomorphic to the Clebsch graph (Q3083411) (← links)
- On the connectivity of k-distance graphs (Q5006605) (← links)
- Hedetniemi's Conjecture and Strongly Multiplicative Graphs (Q5244123) (← links)
- Coloring Powers of Chordal Graphs (Q5317560) (← links)
- (Q5331780) (← links)
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices (Q5878469) (← links)
- On multichromatic numbers of widely colorable graphs (Q6081566) (← links)
