Sparse graphs with bounded induced cycle packing number have logarithmic treewidth - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

Résumé

A graph is $O_k$-free if it does not contain $k$ pairwise vertex-disjoint and non-adjacent cycles. We prove that "sparse" (here, not containing large complete bipartite graphs as subgraphs) $O_k$-free graphs have treewidth (even, feedback vertex set number) at most logarithmic in the number of vertices, which is sharp already for $k=2$. As a consequence, most of the central NP-complete problems (such as Maximum Independent Set, Minimum Vertex Cover, Minimum Dominating Set, Minimum Coloring) can be solved in polynomial time in these graphs, and in particular deciding the $O_k$-freeness of sparse graphs is polytime.

Dates et versions

hal-03685279 , version 1 (02-06-2022)

Identifiants

Citer

Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, et al.. Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 2023, Florence, Italy. pp.3006-3028, ⟨10.1137/1.9781611977554.ch116⟩. ⟨hal-03685279⟩
40 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More