@article{adfb5deadea84e0e81ff090b2d46149f,
title = "Wheel-free planar graphs",
abstract = "A wheel is a graph formed by a chordless cycle C and a vertex u not in C that has at least three neighbors in C. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset. We prove that every planar graph that does not contain a wheel as an induced subgraph is 3-colorable.",
author = "Pierre Aboulker and Maria Chudnovsky and Paul Seymour and Nicolas Trotignon",
note = "Funding Information: First author was partially supported by Agence Nationale de la Recherche under reference Heredia anr 10 jcjc 0204 01 . Second author was supported by NSF grants DMS-1001091 and IIS-1117631 . Third author was supported by ONR grant N00014-10-1-0680 and NSF grant DMS-1265563 . Fourth author was partially supported by ANR project Stint under reference ANR-13-BS02-0007 and by the LABEX MILYON (ANR-10-LABX-0070) of Universite de Lyon, within the program Investissements dAvenir (ANR-11-IDEX-0007) operated by the French National Research Agency (ANR) and INRIA, Universit{\'e} Lyon 1. Publisher Copyright: {\textcopyright} 2015 Elsevier Ltd.",
year = "2015",
month = oct,
day = "1",
doi = "10.1016/j.ejc.2015.02.027",
language = "English (US)",
volume = "49",
pages = "57--67",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
}