Node-Deletion NP-Complete Problems (Q3856812): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:38, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Node-Deletion NP-Complete Problems |
scientific article |
Statements
Node-Deletion NP-Complete Problems (English)
0 references
1979
0 references
null
0 references
complete
0 references
tree
0 references
nonseparable
0 references
planar
0 references
acyclic
0 references
bipartite
0 references
transitive
0 references
Hamiltonian
0 references
outerplanar
0 references
degree-constrained
0 references
line invertible
0 references
without cycles of a specified length
0 references
singleton K-basis
0 references
transitively orientable
0 references
chordal
0 references
interval
0 references
node cover
0 references
node-delection
0 references
NP-complete
0 references
