Interpolation theorems for a family of spanning subgraphs
From MaRDI portal
Publication:4700044
DOI10.1023/A:1022411426718zbMath0927.05076OpenAlexW200283193MaRDI QIDQ4700044
Publication date: 18 November 1999
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/30400
Cites Work
- A solution of Chartrand's problem on spanning trees
- Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
- Matroid tree graphs and interpolation theorems
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
- Interpolation theorem for the number of end‐vertices of spanning trees
- On the Tree Graph of a Matroid
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Interpolation theorems for a family of spanning subgraphs