Pages that link to "Item:Q1750664"
From MaRDI portal
The following pages link to On the maximum number of colorings of a graph (Q1750664):
Displaying 17 items.
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Chromatic coloring with a maximum color class (Q998433) (← 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)
- Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs (Q2032704) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- Maximum number of colourings: 5-chromatic case (Q2323817) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Maximizing the number of <i>q</i> -colorings (Q3059717) (← links)
- Bounded Max-colorings of Graphs (Q3060747) (← links)
- Some extremal results concerning the number of graph and hypergraph colorings (Q3972105) (← links)
- Coloring the Maximal Cliques of Graphs (Q4652597) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Upper bounds on the chromatic polynomial of a connected graph with fixed clique number (Q6045139) (← links)
- Independence number and maximal chromatic polynomials of connected graphs (Q6616432) (← links)
