Edge-disjoint spanning trees and the number of maximum state circles of a graph
From MaRDI portal
Publication:1752609
DOI10.1007/s10878-018-0249-yzbMath1401.90195MaRDI QIDQ1752609
Xian'an Jin, Baoyindureng Wu, Ma, Xiaoli
Publication date: 24 May 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0249-y
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the genus of the alternating knot. II
- A spanning tree expansion of the Jones polynomial
- Genera of the alternating links
- Genus of alternating link types
- A good algorithm for edge-disjoint branching
- Edge-disjoint spanning trees and depth-first search
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Connectivity and edge-disjoint spanning trees
- Über das Geschlecht von Knoten
- Bounds of the number of disjoint spanning trees
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
- GENERA OF THE LINKS DERIVED FROM 2-CONNECTED PLANE GRAPHS
- Clustering, community partition and disjoint spanning trees
- The state numbers of a virtual knot
- The traveling-salesman problem and minimum spanning trees: Part II