On the minimum number of vertices and edges in a graph with a given number of spanning trees

DOI10.21136/CPM.1973.117780zbMath0251.05120OpenAlexW3048286810MaRDI QIDQ5663901

Ladislav Nebeský

Publication date: 1973

Full work available at URL: https://eudml.org/doc/21146

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (2)

Unnamed Item ⋮ Exactly \(k\) MSTs: How many vertices suffice?

This page was built for publication: On the minimum number of vertices and edges in a graph with a given number of spanning trees