The forest plus stars colouring problem (Q1318828): 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 02:54, 5 March 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
