Pages that link to "Item:Q4997140"
From MaRDI portal
The following pages link to Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140):
Displaying 5 items.
- Maximum number of colourings: 5-chromatic case (Q2323817) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← 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)
- Extremal graphs for Widom-Rowlinson colorings in \(k\)-chromatic graphs (Q6660051) (← links)