Graphs with no induced wheel and no induced antiwheel
2015 ◽
Vol 9
(2)
◽
pp. 357-366
◽
Keyword(s):
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. An antiwheel is the complementary graph of a wheel. 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.
2008 ◽
Vol 17
(03)
◽
pp. 349-371
◽
Keyword(s):
2010 ◽
Vol Vol. 12 no. 1
(Graph and Algorithms)
◽
Keyword(s):
2015 ◽
Vol 25
(04)
◽
pp. 283-298
Keyword(s):
2020 ◽
Vol 40
(4)
◽
pp. 1008-1019
2000 ◽
Vol 11
(03)
◽
pp. 405-421
◽
Keyword(s):
Keyword(s):
2011 ◽
Vol 328-330
◽
pp. 1729-1733
2004 ◽
Vol 11
(03)
◽
pp. 219-233
◽
Keyword(s):