A new characterization of \(P_{6}\)-free graphs (Q972332)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new characterization of P₆-free graphs |
scientific article; zbMATH DE number 5711864
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new characterization of \(P_{6}\)-free graphs |
scientific article; zbMATH DE number 5711864 |
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
0 references
0.9828854
0 references
0.9181177
0 references
0.9181177
0 references
0.9179107
0 references
0.91143084
0 references
0 references
0 references
0 references
