The computational complexity of edge colouring restricted graphs
| dc.contributor.author | Cai, Leizhen | en_US |
| dc.date.accessioned | 2024-08-13T17:19:40Z | |
| dc.date.available | 2024-08-13T17:19:40Z | |
| dc.date.copyright | 1988 | en_US |
| dc.date.issued | 1988 | |
| dc.degree.department | Department of Computer Science | |
| dc.degree.level | Master of Science M.Sc. | en |
| dc.description.abstract | Edge colouring a graph is a classic algorithmi,; graph problem which has many applications. The problem of determining the chnmatic index is, in general, NP-complete. This thesis investigates the computational complexity of edge colouring restricted graphs. Previous work has established that the chromatic index problem restricted to k-regular graphs for any fixed k-3 remains NP-complete, whereas the problem restricted to bipartite graphs and partial k-trees for fixed k is in P. We show that the chromatic index problem restricted to comparability graphs, perfect graphs, line graphs, claw-free graphs, triangle-free graphs and some others remains NP-complete. We present linear time optimal edge colouring algorithms for complete graphs, the liPe graphs of trees and the ln 1e graphs of unicyclic graphs. We also present a linear time approximation algorithm, which uses at most four colours, for cubic graphs, and an O (1.682 IV I) algorithm for determining the chromatic index of any cubic graph. | |
| dc.format.extent | 89 pages | |
| dc.identifier.uri | https://hdl.handle.net/1828/17396 | |
| dc.rights | Available to the World Wide Web | en_US |
| dc.title | The computational complexity of edge colouring restricted graphs | en_US |
| dc.type | Thesis | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- CAI_LEIZHEN_MSc_1988_443984.pdf
- Size:
- 1.53 MB
- Format:
- Adobe Portable Document Format