Edge colouring line graphs of unicyclic graphs (Q1186166)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Edge colouring line graphs of unicyclic graphs |
scientific article; zbMATH DE number 36296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge colouring line graphs of unicyclic graphs |
scientific article; zbMATH DE number 36296 |
Statements
Edge colouring line graphs of unicyclic graphs (English)
0 references
28 June 1992
0 references
A characterization of line graphs of unicyclic graphs is established, and it is proved that the line graph \(G\) of a unicyclic graph is in class 1 unless \(G\) is an odd cycle and an optimal edge colouring of the line graph of a unicyclic graph can be computed in time \(O(| E|)\) (note that the chromatic index problem is known to be \(NP\)-complete, even for line graphs). The results are easily extended to line graphs of graphs in which no two cycles have vertices in common.
0 references
edge colouring
0 references
line graphs
0 references
unicyclic graphs
0 references
linear time algorithm
0 references
0.7743701934814453
0 references
0.768837034702301
0 references
0.7584048509597778
0 references
0.757402241230011
0 references
