Degree bounded spanning trees (Q605003): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3921262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the largest tree of given maximum degree in a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, trees, and walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a graph to have a \(k\)-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with bounded degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with few leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a connection between the existence of k-trees and the toughness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On degree sum conditions for long cycles and cycles through specified vertices / rank
 
Normal rank

Latest revision as of 10:55, 3 July 2024

scientific article
Language Label Description Also known as
English
Degree bounded spanning trees
scientific article

    Statements

    Degree bounded spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    12 November 2010
    0 references
    spanning tree
    0 references
    degree bounded tree
    0 references
    degree sum condition
    0 references
    independence number
    0 references
    total excess
    0 references

    Identifiers