| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651689 | Electronic Notes in Discrete Mathematics | 2015 | 6 Pages |
Abstract
Along with a result of Niessen of 1994, a conjecture proposed by Hilton and Chetwynd of 1986 implies that the chromatic index of graphs with Δ≥n/2 can be determined in linear time. Connected cographs satisfy Δ≥n/2, however whether the conjecture holds for cographs is still unknown. This paper presents sufficient conditions for cographs and join graphs to be Class 1.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
