
arXiv: 1603.05018
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. We also show that any graph $G$ with treewidth $k\geq 4$ and maximum degree $2k-1$ satisfies $\chi'(G)=\Delta(G)$, extending an old result of Vizing.
graph theory, G.2.2, Fractional graph theory, fuzzy graph theory, tree width, edge colouring, 05C15, 05C72, 05C75, Coloring of graphs and hypergraphs, FOS: Mathematics, Mathematics - Combinatorics, fractional edge colouring, Structural characterization of families of graphs, Combinatorics (math.CO)
graph theory, G.2.2, Fractional graph theory, fuzzy graph theory, tree width, edge colouring, 05C15, 05C72, 05C75, Coloring of graphs and hypergraphs, FOS: Mathematics, Mathematics - Combinatorics, fractional edge colouring, Structural characterization of families of graphs, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
