Interpolation theorems for a family of spanning subgraphs
From MaRDI portal
Publication:4700044
DOI10.1023/A:1022411426718zbMATH Open0927.05076OpenAlexW200283193MaRDI QIDQ4700044FDOQ4700044
Authors: Sanming Zhou 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- On the Tree Graph of a Matroid
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A solution of Chartrand's problem on spanning trees
- Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
- Interpolation theorem for the number of end‐vertices of spanning trees
- Matroid tree graphs and interpolation theorems
- Title not available (Why is that?)
Cited In (9)
- Interpolation theorems for the arboricity and the vertex arboricity of graphs
- Interpolation theorem for a continuous function on orientations of a simple graph
- Title not available (Why is that?)
- Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interpolation theorems for graphs, hypergraphs and matroids
This page was built for publication: Interpolation theorems for a family of spanning subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4700044)
