Elimination Distance to Bounded Degree on Planar Graphs Preprint - Archive ouverte HAL Access content directly
Journal Articles Fundamenta Informaticae Year : 2024

Elimination Distance to Bounded Degree on Planar Graphs Preprint

Abstract

We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphism problem. We prove that the problem is fixed-parameter tractable on planar graphs, that is, there exists an algorithm that given a planar graph G and integers d, k decides in time f(k, d) · nc for a computable function f and constant c whether the elimination distance of G to the class of degree d graphs is at most k.
No file

Dates and versions

hal-04625778 , version 1 (26-06-2024)

Identifiers

Cite

Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny. Elimination Distance to Bounded Degree on Planar Graphs Preprint. Fundamenta Informaticae, 2024, 191 (2), pp.129-140. ⟨10.3233/FI-242175⟩. ⟨hal-04625778⟩
2 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More