Pages that link to "Item:Q3832593"
From MaRDI portal
The following pages link to On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593):
Displaying 10 items.
- Counting dominating sets and related structures in graphs (Q271644) (← links)
- Maximizing proper colorings on graphs (Q490999) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Optimal graphs for chromatic polynomials (Q2483402) (← links)
- Some corollaries of a theorem of Whitney on the chromatic polynomial (Q2640610) (← links)
- Extremal graphs for homomorphisms (Q5199417) (← links)
- Extremal <i>H</i>‐Colorings of Graphs with Fixed Minimum Degree (Q5251205) (← links)
- The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings (Q6069431) (← links)
