Abstract
We prove a conjecture of Bowlin and Brin that for all n ≥ 5, the n-vertex biwheel is the planar triangulation with n vertices admitting the largest number of four-colourings.
Original language | English (US) |
---|---|
Pages (from-to) | 79-82 |
Number of pages | 4 |
Journal | European Journal of Combinatorics |
Volume | 38 |
DOIs | |
State | Published - May 2014 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics