306 research outputs found

    Nordhaus-Gaddum for Treewidth

    Get PDF
    We prove that for every graph GG with nn vertices, the treewidth of GG plus the treewidth of the complement of GG is at least n−2n-2. This bound is tight

    A note on total and list edge-colouring of graphs of tree-width 3

    Full text link
    It is shown that Halin graphs are Δ\Delta-edge-choosable and that graphs of tree-width 3 are (Δ+1)(\Delta+1)-edge-choosable and (Δ+2)(\Delta +2)-total-colourable.Comment: arXiv admin note: substantial text overlap with arXiv:1504.0212
    • …
    corecore