Spanning trees of dual graphs
From MaRDI portal
Publication:2536470
DOI10.1016/0095-8956(71)90022-0zbMath0187.20804OpenAlexW2053493846MaRDI QIDQ2536470
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90022-0
Related Items (13)
On the maximum order of graphs embedded in surfaces ⋮ Minimum Cuts in Surface Graphs ⋮ The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs ⋮ Layered separators in minor-closed graph classes with applications ⋮ Tri-partitions and bases of an ordered complex ⋮ Minimal covers of the prisms and antiprisms ⋮ On the complexity of a hypermap ⋮ Amas dans les graphes planaires ⋮ Resistors in dual networks ⋮ Spanning subgraphs of embedded graphs ⋮ Fast and compact planar embeddings ⋮ Automorphisms of imbedded graphs ⋮ Navigating planar topologies in near-optimal space and time
Cites Work
This page was built for publication: Spanning trees of dual graphs
