Upper bounds and algorithms for parallel knock-out numbers

DOI10.1016/j.tcs.2008.03.024zbMath1164.68026OpenAlexW2117366439MaRDI QIDQ1008728

Matthew Johnson, Daniël Paulusma, Hajo J. Broersma

Publication date: 30 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/5468/1/5468.pdf

zbMATH Keywords

computational complexityclaw-free graphsparallel knock-out schemes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Path factors and parallel knock-out schemes of almost claw-free graphs, Knocking out \(P_k\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eliminating graphs by means of parallel knock-out schemes
• Claw-free graphs---a survey
• Covering regular graphs
• The computational complexity of the parallel knock-out problem
• Parallel Knockouts in the Complete Graph
• Mathematical Foundations of Computer Science 2004