Block elimination distance

DOI10.1007/978-3-030-86838-3_3OpenAlexW3202572989MaRDI QIDQ5925550

Dimitrios M. Thilikos, Giannos Stamoulis, Archontia C. Giannopoulou, Öznur Yaşar Diner

Publication date: 8 June 2022

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

obstructionsparameterized algorithmsgraph minorsbiconnected graphselimination distance

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Graph isomorphism parameterized by elimination distance to bounded degree
• The disjoint paths problem in quadratic time
• Graph minors. XX: Wagner's conjecture
• Graph minors. XIII: The disjoint paths problem
• Fixed-parameter tractable distances to sparse graph classes
• \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
• Isomorphism of Planar Graphs (Working Paper)
• Elimination Distance to Bounded Degree on Planar Graphs
• Parameterized and Exact Computation
• An Efficient Algorithm for Graph Isomorphism
• Vertex deletion parameterized by elimination distance and even less
• On the Parameterized Complexity of Clique Elimination Distance

This page was built for publication: Block elimination distance