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 OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.076 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982039109 / rank | |||
Normal rank | |||
Latest revision as of 21:20, 19 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
