Triangle-free \(2P_3\)-free graphs are 4-colorable (Q1939592)
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: Triangle-free \(2P_3\)-free graphs are 4-colorable |
scientific article; zbMATH DE number 6141146
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Triangle-free \(2P_3\)-free graphs are 4-colorable |
scientific article; zbMATH DE number 6141146 |
Statements
Triangle-free \(2P_3\)-free graphs are 4-colorable (English)
0 references
4 March 2013
0 references
triangle-free graph
0 references
\(2P_{3}\)-free graph
0 references
vertex coloring
0 references
chromatic number
0 references
