A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs (Q1005227)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5526337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs |
scientific article; zbMATH DE number 5526337 |
Statements
A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs (English)
0 references
9 March 2009
0 references
covering problems
0 references
2-path cover
0 references
edge cover
0 references
optimal tree cover
0 references
tiling problems
0 references
trivalent graphs
0 references
