A pivot Gray code listing for the spanning trees of the fan graph

DOI10.1007/978-3-030-89543-3_5OpenAlexW3209535718MaRDI QIDQ2695273

Ben Cameron, Aaron Grubb, Joe Sawada

Publication date: 30 March 2023

Full work available at URL: https://arxiv.org/abs/2108.09363

zbMATH Keywords

greedy algorithmspanning treefan graphcombinatorial generation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms

Cites Work

• Unnamed Item
• An algorithm for the enumeration of spanning trees
• A flexible algorithm for generating all the spanning trees in undirected graphs
• On trees of a graph and their generation
• The Greedy Gray Code Algorithm
• Finding All Spanning Trees of Directed and Undirected Graphs
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• Unranking and ranking spanning trees of a graph
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• Combinatorial generation via permutation languages
• EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
• On the Tree Graph of a Matroid

This page was built for publication: A pivot Gray code listing for the spanning trees of the fan graph