Interpolation theorem for diameters of spanning trees

DOI10.1109/TCS.1983.1085385MaRDI QIDQ3309850zbMATH OpenFDO

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

Publication date 1983

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

Full work available at URL https://doi.org/10.1109/TCS.1983.1085385

zbMATH Keywords

2-connected graphdiameterfundamental exchangespanning tree

Mathematics Subject Classification ID

Trees (05C05)

Cited in

(12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309850)