9 citations · 18 across the 2 of their papers we have counts for
2 papers
math.CO2015★ 9 cited
The (theta, wheel)-free graphs Part I: only-prism and only-pyramid graphs
Emilie Diot, Marko Radovanović, Nicolas Trotignon +1
Truemper configurations are four types of graphs (namely thetas, wheels, prisms and pyramids) that play an important role in the proof of several decomposition theorems for heredit…
cs.DM2013★ 9 cited
Detecting wheels
Emilie Diot, Sébastien Tavenas, Nicolas Trotignon
A \emph{wheel} is a graph made of a cycle of length at least~4 together with a vertex that has at least three neighbors in the cycle. We prove that the problem whose instance is a…