Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
From MaRDI portal
Publication:3476824
DOI10.1002/jgt.3190130606zbMath0699.05021OpenAlexW2063835257MaRDI QIDQ3476824
Michael J. Plantholt, Frank Harary
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130606
Related Items
Matroid tree graphs and interpolation theorems ⋮ Cycles in circuit graphs of matroids ⋮ The connectivity of the SEE-graph and AEE-graph for the connected spanning \(k\)-edge subgraphs of a graph ⋮ On numbers of vertices of maximum degree in the spanning trees of a graph ⋮ Properties of Hamilton cycles of circuit graphs of matroids ⋮ The connectivity and diameter of second order circuit graphs of matroids ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Hamilton cycles in circuit graphs of matroids ⋮ Interpolation theorems for a family of spanning subgraphs ⋮ Characterizations of matroids with an element lying in a restricted number of circuits ⋮ Interpolation theorems for graphs, hypergraphs and matroids ⋮ Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem ⋮ Interpolation theorems for domination numbers of a graph ⋮ Interpolation theorem for a continuous function on orientations of a simple graph
