Wheel-free planar graphs

3 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : A \emph{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.
Type de document :
Article dans une revue
European Journal of Combinatorics, Elsevier, 2015, 49, 〈10.1016/j.ejc.2015.02.027〉

https://hal.archives-ouvertes.fr/hal-01230782
Contributeur : Nicolas Trotignon <>
Soumis le : jeudi 19 novembre 2015 - 08:35:59
Dernière modification le : vendredi 20 avril 2018 - 15:44:25

Citation

Pierre Aboulker, Maria Chudnovsky, Paul Seymour, Nicolas Trotignon. Wheel-free planar graphs. European Journal of Combinatorics, Elsevier, 2015, 49, 〈10.1016/j.ejc.2015.02.027〉. 〈hal-01230782〉

Métriques

Consultations de la notice