The following pages link to Maximising ‐colourings of graphs (Q5241611):
Displaying 9 items.
- Extremal \(H\)-colorings of trees and 2-connected graphs (Q345129) (← links)
- \(H\)-colouring bipartite graphs (Q414646) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Maximizing the number of <i>q</i> -colorings (Q3059717) (← links)
- Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (Q4978445) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree (Q6640963) (← links)
