Linear-time algorithms for eliminating claws in graphs

DOI10.1007/978-3-030-58150-3_2MaRDI QIDQ2019430zbMATH OpenOpenAlexFDO

Authors Fabiano S. Oliveira, Uéverton S. Souza, Flavia Bonomo, Julliano Rosa Nascimento, Jayme L. 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)

Cited in

(7)

• scientific article; zbMATH DE number 7080199 (Why is no real title available?)
• Declawing a graph: polyhedra and branch-and-cut algorithms
• scientific article; zbMATH DE number 7204318 (Why is no real title available?)
• On the \(d\)-claw vertex deletion problem
• Hitting forbidden induced subgraphs on bounded treewidth graphs
• scientific article; zbMATH DE number 1420921 (Why is no real title available?)
• On the \(d\)-claw vertex deletion problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019430)