Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (Q3393426)

From MaRDI portal
Revision as of 02:55, 5 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
scientific article

    Statements

    Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (English)
    0 references
    0 references
    20 August 2009
    0 references
    spanning tree
    0 references
    Max leaf
    0 references
    connected dominating set
    0 references
    extremal graph theory
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references