Pages that link to "Item:Q4206761"
From MaRDI portal
The following pages link to New upper bounds for the greatest number of proper colorings of a (<i>V</i>,<i>E</i>)‐graph (Q4206761):
Displaying 7 items.
- Maximizing proper colorings on graphs (Q490999) (← links)
- On deterministic finite automata and syntactic monoid size (Q703576) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- A contribution to the chromatic theory of uniform hypergraphs (Q1896647) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- Some corollaries of a theorem of Whitney on the chromatic polynomial (Q2640610) (← links)
