A note on matchings and spanning trees with bounded degrees (Q1359373): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with bounded degrees / rank
 
Normal rank

Revision as of 16:12, 27 May 2024

scientific article
Language Label Description Also known as
English
A note on matchings and spanning trees with bounded degrees
scientific article

    Statements

    A note on matchings and spanning trees with bounded degrees (English)
    0 references
    3 July 1997
    0 references
    Let \(G\) be a \(k\)-connected graph with independence number \(\alpha\) and let \(G\) contain a perfect matching. If \(\alpha\leq 1+ {3\over 2}k\), the matching can be extended to a spanning tree of \(G\) with maximum degree at most three.
    0 references
    independence number
    0 references
    perfect matching
    0 references
    spanning tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references