Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108)
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: Critical (Pā, banner)-free graphs |
scientific article; zbMATH DE number 7040831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Critical \((P_6, \mathrm{banner})\)-free graphs |
scientific article; zbMATH DE number 7040831 |
Statements
Critical \((P_6, \mathrm{banner})\)-free graphs (English)
0 references
22 March 2019
0 references
coloring
0 references
critical graphs
0 references
hereditary classes
0 references
strong perfect graph theorem
0 references
polynomial-time algorithms
0 references
0.8320273160934448
0 references
0.8098466396331787
0 references
0.8073719143867493
0 references
0.8009196519851685
0 references
0.7945093512535095
0 references
