Pages that link to "Item:Q3059717"
From MaRDI portal
The following pages link to Maximizing the number of <i>q</i> -colorings (Q3059717):
Displaying 21 items.
- Counting dominating sets and related structures in graphs (Q271644) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Maximizing proper colorings on graphs (Q490999) (← links)
- An analytic approach to stability (Q710597) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Maximizing the number of unused colors in the vertex coloring problem (Q1336741) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Minimax relations for the partial q-colorings of a graph (Q1825878) (← links)
- Counting proper colourings in 4-regular graphs via the Potts model (Q1991414) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- Counting colorings of a regular graph (Q2345527) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Hypergraph Independent Sets (Q4903260) (← links)
- Maximizing <i>H</i>‐Colorings of a Regular Graph (Q4920651) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Extremal graphs for homomorphisms (Q5199417) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- An Extremal Property of Turán Graphs, II (Q5417822) (← links)
- Extremal Graphs for Homomorphisms II (Q5418768) (← links)
- The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings (Q6069431) (← links)
