A lower bound on solutions of Chartrand's problem

DOI10.1007/BF01883897zbMath0577.05024OpenAlexW2313769952MaRDI QIDQ1065813

Liu Guizhen

Publication date: 1984

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01883897

zbMATH Keywords

spanning trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (2)

The connectivity of the SEE-graph and AEE-graph for the connected spanning \(k\)-edge subgraphs of a graph ⋮ Interpolation theorem for a continuous function on orientations of a simple graph

Cites Work

• A solution of Chartrand's problem on spanning trees
• Two Algorithms for Generating Weighted Spanning Trees in Order

This page was built for publication: A lower bound on solutions of Chartrand's problem