Matroid tree graphs and interpolation theorems (Q1343812): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of interpolation theorems for spanning trees and other families of spanning subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tree Graph of a Matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorem for the number of end‐vertices of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381130 / rank
 
Normal rank

Latest revision as of 11:43, 23 May 2024

scientific article
Language Label Description Also known as
English
Matroid tree graphs and interpolation theorems
scientific article

    Statements

    Matroid tree graphs and interpolation theorems (English)
    0 references
    0 references
    6 February 1995
    0 references
    0 references
    hamiltonicity
    0 references
    matroid tree graphs
    0 references
    interpolation theorem
    0 references
    interpolation problems
    0 references