Listing spanning trees of outerplanar graphs by Pivot-exchanges

DOI10.4230/LIPICS.STACS.2025.16MaRDI QIDQ7287747zbMATH OpenFDO

Authors Nastaran Behrooznia, Torsten Mütze

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.16

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A flexible algorithm for generating all the spanning trees in undirected graphs
• A Survey of Combinatorial Gray Codes
• All your bases are belong to us: listing all bases of a matroid by greedy exchanges
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Combinatorial Gray codes -- an updated survey
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
• Finding All Spanning Trees of Directed and Undirected Graphs
• Hamiltonicity and combinatorial polyhedra
• Hamiltonicity in (0-1)-polyhedra
• scientific article; zbMATH DE number 177570 (Why is no real title available?)
• scientific article; zbMATH DE number 3559604 (Why is no real title available?)
• On the Tree Graph of a Matroid
• Pivot Gray codes for the spanning trees of a graph ft. the fan
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• Traversing combinatorial 0/1-polytopes via optimization
• Two Algorithms for Unranking Arborescences
• Unranking and ranking spanning trees of a graph

This page was built for publication: Listing spanning trees of outerplanar graphs by Pivot-exchanges

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