Linear-time algorithms for eliminating claws in graphs

DOI10.1007/978-3-030-58150-3_2OpenAlexW3081839627MaRDI QIDQ2019430

Fabiano S. Oliveira, Uéverton S. Souza, Julliano Rosa Nascimento, Flavia Bonomo-Braberman, Jayme Luiz Szwarcfiter

Publication date: 21 April 2021

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

zbMATH Keywords

claw-free graphvertex deletionweighted vertex deletion

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (4)

On the \(d\)-claw vertex deletion problem ⋮ On the \(d\)-claw vertex deletion problem ⋮ Declawing a graph: polyhedra and branch-and-cut algorithms ⋮ Hitting forbidden induced subgraphs on bounded treewidth graphs

This page was built for publication: Linear-time algorithms for eliminating claws in graphs