Graphs with not too many spanning trees

DOI10.1002/net.3230250405zbMath0843.90121OpenAlexW2069653535MaRDI QIDQ4861349

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)

Related Items (3)

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 ⋮ Bounding the number of circuits of a graph

Cites Work

• On Independent Circuits Contained in a Graph
• Unnamed Item

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