Minimum spanning tree cycle intersection problem on outerplanar graphs
From MaRDI portal
Publication:6180692
DOI10.1016/J.DAM.2023.11.011zbMATH Open1529.05095MaRDI QIDQ6180692FDOQ6180692
Authors: Tai-Yu Su 
Publication date: 2 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- Characterizations of outerplanar graphs
- Minimum strictly fundamental cycle bases of planar graphs are hard to find
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Algorithms for Generating Fundamental Cycles in a Graph
- Spanning tree congestion of planar graphs
- New length bounds for cycle bases
- Lower-Stretch Spanning Trees
- Classes of cycle bases
- Minimum cut bases in undirected networks
- Proof of a conjecture about minimum spanning tree cycle intersection
- Minimum spanning tree cycle intersection problem
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)
