Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014)
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: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences |
scientific article; zbMATH DE number 5569124
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences |
scientific article; zbMATH DE number 5569124 |
Statements
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (English)
0 references
23 June 2009
0 references
even-hole-free graphs
0 references
decomposition
0 references
\(\chi \)-bounded families
0 references
\(\beta \)-perfect graphs
0 references
greedy coloring algorithm
0 references
0.8545522689819336
0 references
0.8345105051994324
0 references
0.8226799368858337
0 references
0.8196661472320557
0 references
0.8110863566398621
0 references
