$(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143)
From MaRDI portal
scientific article; zbMATH DE number 7099866
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $(2P_2,K_4)$-Free Graphs are 4-Colorable |
scientific article; zbMATH DE number 7099866 |
Statements
$(2P_2,K_4)$-Free Graphs are 4-Colorable (English)
0 references
29 August 2019
0 references
graph coloring
0 references
\(\chi\)-bound
0 references
forbidden induced subgraphs
0 references
approximation algorithm
0 references
