Pages that link to "Item:Q5434250"

The following pages link to Maximum number of colorings of (2<i>k, k</i>²)‐graphs (Q5434250):

Displaying 15 items.

• Maximizing proper colorings on graphs (Q490999) (← links)
• An extremal property of Turán graphs (Q612959) (← links)
• An analytic approach to stability (Q710597) (← links)
• Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
• On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\) (Q875716) (← links)
• Two path extremal graphs and an application to a Ramsey-type problem (Q1297399) (← links)
• Induced subgraphs of given sizes (Q1301633) (← links)
• Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← 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)
• \(M_2\)-edge coloring and maximum matching of graphs (Q2867712) (← links)
• The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings (Q2890303) (← links)
• An Extremal Property of Turán Graphs, II (Q5417822) (← links)
• Colorings of the Graph K ᵐ 2 + Kn (Q5859213) (← links)
• The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings (Q6069431) (← links)