Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995)
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: Determining the chromatic number of triangle-free 2P₃-free graphs in polynomial time |
scientific article; zbMATH DE number 6034854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time |
scientific article; zbMATH DE number 6034854 |
Statements
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (English)
0 references
14 May 2012
0 references
chromatic number
0 references
triangle-free
0 references
forbidden induced subgraph
0 references
0 references
0.8774371147155762
0 references
0.8565917611122131
0 references
0.8438975214958191
0 references
0.8411809206008911
0 references
0.8344876170158386
0 references
