Eliminating graphs by means of parallel knock-out schemes
type: Item
instance of: scholarly article
title: Eliminating graphs by means of parallel knock-out schemes
zbMATH Open document ID: 1109.05091
author: Fedor V. Fomin
author: Rastislav Královič
author: Gerhard J. Woeginger
author: Hajo Broersma
published in: Discrete Applied Mathematics
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5128015
zbMATH Keywords: knock-out number
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: perfect matching
zbMATH Keywords: tree
zbMATH Keywords: claw-free graph
zbMATH Keywords: computational complexity
zbMATH Keywords: dynamic programming
Wikidata QID: Q60488755
MaRDI profile type: Publication
full work available at URL: j.dam.2006.04.034
OpenAlex ID: W2071675546
cites work: The Computational Complexity of the Parallel Knock-Out Problem
cites work: Q4350166
cites work: Claw-free graphs---a survey
cites work: Parallel Knockouts in the Complete Graph
cites work: Q4074931
cites work: Matching theory
cites work: Q3348939
cites work: Graphs with 1-Factors
DOI: 10.1016/J.DAM.2006.04.034
description: scientific article; zbMATH DE number 5128015