Interpolation theorems for a family of spanning subgraphs (Q4700044): 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: A solution of Chartrand's problem on spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220612 / 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: Interpolation theorem for the number of end‐vertices of spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid tree graphs and interpolation theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264553 / rank
 
Normal rank

Revision as of 10:17, 29 May 2024

scientific article; zbMATH DE number 1364440
Language Label Description Also known as
English
Interpolation theorems for a family of spanning subgraphs
scientific article; zbMATH DE number 1364440

    Statements