The following pages link to (Q4216396):
Displayed 5 items.
- A complete solution to the chromatic equivalence class of graph \(\overline {B_{n-7,1,3}}\) (Q932684) (← links)
- A new method for proving chromatic uniqueness of graphs (Q1363698) (← links)
- Adjoint polynomials and chromatically unique graphs (Q1366781) (← links)
- New families of adjointly unique graphs (Q1366788) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)