Edge colouring line graphs of unicyclic graphs (Q1186166): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: NP-completeness of edge-colouring some restricted graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3853641 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness column: an ongoing guide / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness column: An ongoing guide / rank | |||
Normal rank | |||
Latest revision as of 17:01, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge colouring line graphs of unicyclic graphs |
scientific article |
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
