Graphs with no induced wheel or antiwheel
Combinatorics
2015-02-27 v1 Discrete Mathematics
Abstract
A wheel is a graph that consists of a chordless cycle of length at least 4 plus a vertex with at least three neighbors on the cycle. It was shown recently that detecting induced wheels is an NP-complete problem. In contrast, it is shown here that graphs that contain no wheel and no antiwheel have a very simple structure and consequently can be recognized in polynomial time.
Keywords
Cite
@article{arxiv.1502.07484,
title = {Graphs with no induced wheel or antiwheel},
author = {Frédéric Maffray},
journal= {arXiv preprint arXiv:1502.07484},
year = {2015}
}