Eliminating graphs by means of parallel knock-out schemes (Q867852): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q234411 |
Changed an Item |
||
| Property / author | |||
| Property / author: Hajo J. Broersma / rank | |||
Normal rank | |||
Revision as of 08:25, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eliminating graphs by means of parallel knock-out schemes |
scientific article |
Statements
Eliminating graphs by means of parallel knock-out schemes (English)
0 references
19 February 2007
0 references
knock-out number
0 references
Hamiltonian cycle
0 references
perfect matching
0 references
tree
0 references
claw-free graph
0 references
computational complexity
0 references
dynamic programming
0 references
