Testing subdivision-freeness
From MaRDI portal
Publication:5495814
DOI10.1145/2488608.2488663zbMath1293.05316OpenAlexW1976944496MaRDI QIDQ5495814
Yuichi Yoshida, Ken-ichi Kawarabayashi
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488663
Structural characterization of families of graphs (05C75) Graph minors (05C83) Vertex degrees (05C07)
Related Items (2)
On the tree-width of even-hole-free graphs ⋮ An explicit construction of graphs of bounded degree that are far from being Hamiltonian
This page was built for publication: Testing subdivision-freeness
