Detecting wheels
From MaRDI portal
Publication:2815233
DOI10.2298/AADM131128023DzbMath1349.05323arXiv1308.6433MaRDI QIDQ2815233
Emilie Diot, Sébastien Tavenas, Nicolas Trotignon
Publication date: 27 June 2016
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6433
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)
Related Items (3)
The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs ⋮ Wheel-free planar graphs
This page was built for publication: Detecting wheels
