Interpolation theorem for diameters of spanning trees

DOI10.1109/TCS.1983.1085385zbMath0528.05019MaRDI QIDQ3309850

Robert J. Mokken, Michael J. Plantholt, Frank Harary

Publication date: 1983

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

zbMATH Keywords

diameterspanning tree2-connected graphfundamental exchange

Mathematics Subject Classification ID

Trees (05C05)

Related Items (11)

On numbers of vertices of maximum degree in the spanning trees of a graph ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ On a tree graph defined by a set of cycles ⋮ The biplanar tree graph ⋮ Spanning trees: A survey ⋮ The basis graph of a bicolored matroid ⋮ A discrete Morse perspective on knot projections and a generalised clock theorem ⋮ Interpolation theorems for graphs, hypergraphs and matroids ⋮ Interpolation theorems for domination numbers of a graph ⋮ Spanning subgraphs of a hypercube. IV: Rooted trees ⋮ Interpolation theorem for a continuous function on orientations of a simple graph

This page was built for publication: Interpolation theorem for diameters of spanning trees