Distance-hereditary graphs are clique-perfect (Q2489948)
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: Distance-hereditary graphs are clique-perfect |
scientific article; zbMATH DE number 5021047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distance-hereditary graphs are clique-perfect |
scientific article; zbMATH DE number 5021047 |
Statements
Distance-hereditary graphs are clique-perfect (English)
0 references
28 April 2006
0 references
Graphs
0 references
Clique-transversal number
0 references
Clique-independence number
0 references
Distance-hereditary graphs
0 references
0 references
0.9156905
0 references
0.9137326
0 references
0 references
0.9070856
0 references
0.9068594
0 references
0 references
0 references
0.90083516
0 references
0 references
