Pages that link to "Item:Q2421556"
From MaRDI portal
The following pages link to A proof of Tomescu's graph coloring conjecture (Q2421556):
Displaying 8 items.
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← 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)
- Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci (Q3295267) (← 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)