Pages that link to "Item:Q4842706"
From MaRDI portal
The following pages link to Graphs with least number of colorings (Q4842706):
Displaying 8 items.
- Graphs with the fewest matchings (Q524194) (← links)
- Chromatic polynomials with least coefficients (Q1366784) (← links)
- Planar graphs with least chromatic coefficients (Q1366785) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Optimal graphs for independence and \(k\)-independence polynomials (Q1756111) (← links)
- Some algebraic methods for calculating the number of colorings of a graph (Q1781373) (← links)
- Optimal domination polynomials (Q2227988) (← links)
- Optimal graphs for chromatic polynomials (Q2483402) (← links)