Partition of a planar graph with girth 6 into two forests with chain length at most 4 (Q5264731)

From MaRDI portal
Revision as of 19:34, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 6466089
Language Label Description Also known as
English
Partition of a planar graph with girth 6 into two forests with chain length at most 4
scientific article; zbMATH DE number 6466089

    Statements

    Partition of a planar graph with girth 6 into two forests with chain length at most 4 (English)
    0 references
    27 July 2015
    0 references
    planar graph
    0 references
    girth
    0 references
    path partition
    0 references

    Identifiers