Proof of a conjecture of Bowlin and Brin on four-colouring triangulations

Research output: Contribution to journalArticlepeer-review

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 languageEnglish (US)
Pages (from-to)79-82
Number of pages4
JournalEuropean Journal of Combinatorics
Volume38
DOIs
StatePublished - May 2014

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Proof of a conjecture of Bowlin and Brin on four-colouring triangulations'. Together they form a unique fingerprint.

Cite this