Parallel Knockouts in the Complete Graph

DOI10.2307/2589409MaRDI QIDQ4222445zbMATH OpenOpenAlexFDO

Authors Douglas E. Lampert, Peter Slater

Publication date 23 April 1999

Full work available at URL https://doi.org/10.2307/2589409

zbMATH Keywords

independent setparallel knockout

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Mathematical Foundations of Computer Science 2004
• Eliminating graphs by means of parallel knock-out schemes
• Upper Bounds and Algorithms for Parallel Knock-Out Numbers
• Upper bounds and algorithms for parallel knock-out numbers
• The computational complexity of the parallel knock-out problem

Cited in

(6)

• Upper bounds and algorithms for parallel knock-out numbers
• Averaging sequences, deranged mappings, and a problem of Lampert and Slater
• Knocking out \(P_k\)-free graphs
• The computational complexity of the parallel knock-out problem
• Eliminating graphs by means of parallel knock-out schemes
• Path factors and parallel knock-out schemes of almost claw-free graphs

This page was built for publication: Parallel Knockouts in the Complete Graph

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