A new characterization of \(P_{6}\)-free graphs (Q972332): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:34, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new characterization of \(P_{6}\)-free graphs |
scientific article |
Statements
A new characterization of \(P_{6}\)-free graphs (English)
0 references
25 May 2010
0 references
paths
0 references
cycles
0 references
induced subgraphs
0 references
complete bipartite graph
0 references
dominating set
0 references
computational complexity
0 references
