Pages that link to "Item:Q5251205"
From MaRDI portal
The following pages link to Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205):
Displaying 12 items.
- Extremal \(H\)-colorings of trees and 2-connected graphs (Q345129) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Inequalities with respect to graph homomorphism (Q1210578) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Homomorphisms into loop-threshold graphs (Q2185229) (← links)
- Graph homomorphisms via vector colorings (Q2422244) (← links)
- Random graph-homomorphisms and logarithmic degree (Q2461995) (← 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)
- Maximising ‐colourings of graphs (Q5241611) (← links)
- Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree (Q6640963) (← links)
- Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs (Q6660051) (← links)