Algorithm for two disjoint long paths in 2-connected graphs
From MaRDI portal
Publication:986559
DOI10.1016/j.tcs.2010.05.022zbMath1209.05133MaRDI QIDQ986559
Hao Li, Guang-Hui Wang, Shan Zhou
Publication date: 11 August 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.022
Cites Work
- Algorithms for long paths in graphs
- Hamiltonism, degree sum and neighborhood intersections
- Longest cycles in 3-connected graphs
- On cycles in 3-connected graphs
- Color-coding
- Finding long paths and cycles in sparse Hamiltonian graphs
- Note on Hamilton Circuits
- On Linear Time Minor Tests with Depth-First Search
- Finding a Path of Superlogarithmic Length
- Some Theorems on Abstract Graphs
- Combinatorial optimization. Theory and algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item