On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs

DOI10.1002/jgt.22026zbMath1359.05023OpenAlexW2302210904WikidataQ56926462 ScholiaQ56926462MaRDI QIDQ2978176

Seongmin Ok, Carsten Thomassen

Publication date: 21 April 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22026

zbMATH Keywords

spanning treecubic graphedge connectivity

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (3)

Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP ⋮ On the minimum number of spanning trees in cubic multigraphs ⋮ The minimum number of spanning trees in regular multigraphs

Cites Work

• Unnamed Item
• Resistances and currents in infinite electrical networks
• Complexite et circuits euleriens dans les sommes tensorielles de graphes
• The dissection of rectangles into squares
• A Reduction Method for Edge-Connectivity in Graphs
• The number of spanning trees in graphs with a given degree sequence

This page was built for publication: On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs