Pages that link to "Item:Q4920651"
From MaRDI portal
The following pages link to Maximizing <i>H</i>‐Colorings of a Regular Graph (Q4920651):
Displaying 15 items.
- The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph (Q518178) (← links)
- A reverse Sidorenko inequality (Q785934) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Counting proper colourings in 4-regular graphs via the Potts model (Q1991414) (← links)
- Homomorphisms into loop-threshold graphs (Q2185229) (← links)
- Counting colorings of a regular graph (Q2345527) (← links)
- Maximizing the number of <i>q</i> -colorings (Q3059717) (← links)
- On replica symmetry of large deviations in random graphs (Q3192375) (← links)
- A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs (Q3466354) (← links)
- Extremal Regular Graphs: Independent Sets and Graph Homomorphisms (Q4575432) (← links)
- Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (Q4978445) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- On the Widom–Rowlinson Occupancy Fraction in Regular Graphs (Q5366940) (← 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)
