Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653677 | European Journal of Combinatorics | 2014 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Paul Seymour,