Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:13, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time |
scientific article |
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
