Minimum spanning tree cycle intersection problem on outerplanar graphs

DOI10.1016/j.dam.2023.11.011zbMath1529.05095MaRDI QIDQ6180692

Tai-Yu Su

Publication date: 2 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

outerplanar graphscycle basesspanning trees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Cites Work

• Minimum strictly fundamental cycle bases of planar graphs are hard to find
• Spanning tree congestion of planar graphs
• Classes of cycle bases
• Minimum cut bases in undirected networks
• Characterizations of outerplanar graphs
• Proof of a conjecture about minimum spanning tree cycle intersection
• New length bounds for cycle bases
• Minimum spanning tree cycle intersection problem
• Lower-Stretch Spanning Trees
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Algorithms for Generating Fundamental Cycles in a Graph

This page was built for publication: Minimum spanning tree cycle intersection problem on outerplanar graphs