Parallel Knockouts in the Complete Graph

DOI10.2307/2589409zbMath0974.05079OpenAlexW4233485246MaRDI QIDQ4222445

Douglas E. Lampert, Peter J. 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)

Related Items (6)

Eliminating graphs by means of parallel knock-out schemes ⋮ The computational complexity of the parallel knock-out problem ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ 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

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