Some results on spanning trees (Q601948): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Spanning Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-distinguishing proper edge-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Domination and Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic survey of graph labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the circumference of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bandwidth sums of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On upper bounds of bandwidths of trees / rank
 
Normal rank

Latest revision as of 10:17, 3 July 2024

scientific article
Language Label Description Also known as
English
Some results on spanning trees
scientific article

    Statements

    Some results on spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    29 October 2010
    0 references
    0 references
    spanning tree
    0 references
    leaves
    0 references
    diameter
    0 references
    Steiner tree
    0 references
    independent number
    0 references
    0 references