arXiv Analytics

Sign in

arXiv:1603.05018 [math.CO]AbstractReferencesReviewsResources

Chromatic index, treewidth and maximum degree

Henning Bruhn, Laura Gellert, Richard Lang

Published 2016-03-16Version 1

We conjecture that any graph $G$ with treewidth $k$ and maximum degree $\Delta(G)\geq k + \sqrt{k}$ satisfies $\chi'(G)=\Delta(G)$. In support of the conjecture we prove its fractional version.

Comments: 13 pages, 2 figures
Categories: math.CO
Subjects: 05C15, 05C72, 05C75, G.2.2
Related articles: Most relevant | Search more
arXiv:2403.09518 [math.CO] (Published 2024-03-14)
About Berge-Füredi's conjecture on the chromatic index of hypergraphs
arXiv:1012.2693 [math.CO] (Published 2010-12-13, updated 2010-12-14)
A solution to a conjecture on the rainbow connection number
arXiv:1710.08982 [math.CO] (Published 2017-10-24)
$t$-cores for $(Δ+t)$-edge-colouring

Links

Toolbox