The forest plus stars colouring problem (Q1318828): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)90282-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998998699 / rank | |||
Normal rank | |||
Latest revision as of 11:03, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The forest plus stars colouring problem |
scientific article |
Statements
The forest plus stars colouring problem (English)
0 references
4 April 1994
0 references
The author shows that every graph which is the union of a forest and a forest not containing a path of length three as a subgraph is 3- colorable.
0 references
forest plus stars colouring problem
0 references
