Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (Q2341756)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs |
scientific article |
Statements
Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs (English)
0 references
28 April 2015
0 references
\(P_4\) vertex cover
0 references
regular graph
0 references
\(K_{1,4}\)-free graph
0 references
approximation algorithm
0 references
