Proof of a conjecture of Bowlin and Brin on four-colouring triangulations
Author(s): Seymour, Paul D.
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr10t17| 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. (C) 2013 Elsevier Ltd. All rights reserved. |
| Publication Date: | May-2014 |
| Electronic Publication Date: | 5-Dec-2013 |
| Citation: | Seymour, Paul. (2014). Proof of a conjecture of Bowlin and Brin on four-colouring triangulations. EUROPEAN JOURNAL OF COMBINATORICS, 38 (79 - 82. doi:10.1016/j.ejc.2013.11.005 |
| DOI: | doi:10.1016/j.ejc.2013.11.005 |
| ISSN: | 0195-6698 |
| EISSN: | 1095-9971 |
| Pages: | 79 - 82 |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | EUROPEAN JOURNAL OF COMBINATORICS |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.