Obstructions to within a few vertices or edges of acyclic

DOI10.1007/3-540-60220-8_81zbMath1502.68215arXivmath/9502226MaRDI QIDQ5057453

Michael J. Dinneen, Kevin Cattell, Michael R. Fellows

Publication date: 16 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9502226

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

A simple linear-time algorithm for finding path-decompositions of small width, On computing graph minor obstruction sets