Leafy spanning trees in hypercubes (Q5950587): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short note on the approximability of the maximum leaves spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in hypercubes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0893-9659(01)00047-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066857130 / rank
 
Normal rank

Latest revision as of 10:48, 30 July 2024

scientific article; zbMATH DE number 1684749
Language Label Description Also known as
English
Leafy spanning trees in hypercubes
scientific article; zbMATH DE number 1684749

    Statements

    Leafy spanning trees in hypercubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 January 2002
    0 references
    A lower bound is found for the number of leaves of a spanning tree in a \(d\)-dimensional hypercube. This improves on the bound implied by a more general result of \textit{D. J. Kleitman} and \textit{D. B. West} [SIAM J. Discrete Math. 4, No. 1, 99-106 (1991; Zbl 0734.05041)].
    0 references
    leaves in trees of hypercubes
    0 references

    Identifiers