Minimum spanning tree cycle intersection problem on outerplanar graphs

DOI10.1016/J.DAM.2023.11.011MaRDI QIDQ6180692zbMATH OpenFDO

Authors Tai-Yu Su

Publication date 2 January 2024

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

Full work available at URL https://doi.org/10.1016/J.DAM.2023.11.011

zbMATH Keywords

spanning treescycle basesouterplanar graphs

Mathematics Subject Classification ID

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

Recommendations

• Minimum spanning tree cycle intersection problem
• Cycle intersection in spanning trees: a shorter proof of a conjecture and applications
• Proof of a conjecture about minimum spanning tree cycle intersection
• Minimum cycle bases of weighted outerplanar graphs
• Minimum cycle bases of weighted outerplanar graphs

Cites work

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

Cited in

(1)

• Cycle intersection in spanning trees: a shorter proof of a conjecture and applications

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

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