Pages that link to "Item:Q4861349"
From MaRDI portal
The following pages link to Graphs with not too many spanning trees (Q4861349):
Displaying 5 items.
- Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees (Q834895) (← links)
- Graphs with only caterpillars as spanning trees (Q1415546) (← links)
- Graphs with at most two trees in a forest-building process (Q2424270) (← links)
- Bounding the number of circuits of a graph (Q2563510) (← links)
- Bounding the number of bases of a matroid (Q5917662) (← links)