Partitioning graphs of bounded tree-width (Q1307308)

From MaRDI portal
Revision as of 18:09, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Partitioning graphs of bounded tree-width
scientific article

    Statements

    Partitioning graphs of bounded tree-width (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 October 1999
    0 references
    This paper studies vertex partitions and edge partitions of graphs of bounded tree-width into graphs of smaller tree-width. First the existence of several kinds of such partitions is proved. Then it is shown that some of the results of the first part are close to being best possible. Finally a result on partitioning graphs of bounded tree-width into star-forests is described.
    0 references
    tree-width
    0 references
    coloring
    0 references
    partitions
    0 references
    star-forests
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references