Spanning \(k\)-ended trees of bipartite graphs (Q394291): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Factors and factorizations of graphs. Proof techniques in factor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence trees and Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian bipartite graphs / 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: Spanning trees: A survey / rank
 
Normal rank

Latest revision as of 07:23, 7 July 2024

scientific article
Language Label Description Also known as
English
Spanning \(k\)-ended trees of bipartite graphs
scientific article

    Statements

    Spanning \(k\)-ended trees of bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 January 2014
    0 references
    spanning tree
    0 references
    spanning \(k\)-ended tree
    0 references
    spanning tree with at most \(k\) leaves
    0 references

    Identifiers