306 research outputs found
Nordhaus-Gaddum for Treewidth
We prove that for every graph with vertices, the treewidth of
plus the treewidth of the complement of is at least . This bound is
tight
A note on total and list edge-colouring of graphs of tree-width 3
It is shown that Halin graphs are -edge-choosable and that graphs of
tree-width 3 are -edge-choosable and -total-colourable.Comment: arXiv admin note: substantial text overlap with arXiv:1504.0212
- …