Linear-time algorithms for eliminating claws in graphs

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

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)

• Title not available (Why is that?)
• Declawing a graph: polyhedra and branch-and-cut algorithms
• Title not available (Why is that?)
• On the \(d\)-claw vertex deletion problem
• On the \(d\)-claw vertex deletion problem
• Hitting forbidden induced subgraphs on bounded treewidth graphs
• Title not available (Why is that?)

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)