1 research outputs found
Chromatic index, treewidth and maximum degree
We conjecture that any graph with treewidth~ and maximum degree
satisfies . In support of the
conjecture we prove its fractional version. We also show that any graph
with treewidth~ and maximum degree satisfies
, improving an old result of Vizing.Comment: 14 pages, 3 figures, minor changes, accepted for publication in
Electronic Journal of Combinatoric