Back to Search
Start Over
Chromatic index, treewidth and maximum degree.
- Source :
- Electronic Notes in Discrete Mathematics; Oct2016, Vol. 54, p259-264, 6p
- Publication Year :
- 2016
-
Abstract
- We conjecture that any graph G with treewidth k and maximum degree Δ ( G ) ≥ k + k satisfies χ ′ ( G ) = Δ ( G ) . In support of the conjecture we prove its fractional version. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 15710653
- Volume :
- 54
- Database :
- Supplemental Index
- Journal :
- Electronic Notes in Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 118739663
- Full Text :
- https://doi.org/10.1016/j.endm.2016.09.045