On spanning cycles, paths and trees (Q2446869): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.03.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040226988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves and average distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal spanning trees with a constraint on the number of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Degree, Leaf Number, and Hamiltonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEGREE DISTANCE AND MINIMUM DEGREE / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding spanning trees with few leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5494200 / rank
 
Normal rank

Latest revision as of 11:04, 8 July 2024

scientific article
Language Label Description Also known as
English
On spanning cycles, paths and trees
scientific article

    Statements

    On spanning cycles, paths and trees (English)
    0 references
    0 references
    22 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    centralized terminal network
    0 references
    leaf number
    0 references
    Hamiltonicity
    0 references
    traceability
    0 references
    minimum degree
    0 references
    0 references