Pages that link to "Item:Q4978445"
From MaRDI portal
The following pages link to Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (Q4978445):
Displaying 4 items.
- Extremal \(H\)-colorings of trees and 2-connected graphs (Q345129) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
