Graphs with not too many spanning trees

DOI10.1002/NET.3230250405MaRDI QIDQ4861349zbMATH OpenOpenAlexFDO

Authors Guoli Ding

Publication date 16 January 1996

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230250405

zbMATH Keywords

network designnumber of spanning treestopological minorstopological minor closed classes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 932184
• scientific article; zbMATH DE number 3987294
• On family of graphs with minimum number of spanning trees
• scientific article; zbMATH DE number 4083675
• On the characterization of graphs with maximum number of spanning trees

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On Independent Circuits Contained in a Graph

Cited in

(5)

• Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees
• Bounding the number of bases of a matroid
• Graphs with at most two trees in a forest-building process
• Bounding the number of circuits of a graph
• Graphs with only caterpillars as spanning trees

This page was built for publication: Graphs with not too many spanning trees

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