Algorithm for two disjoint long paths in 2-connected graphs

DOI10.1016/J.TCS.2010.05.022MaRDI QIDQ986559zbMATH OpenOpenAlexFDO

Authors Shan Zhou, Hao Li, Guanghui Wang

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

zbMATH Keywords

degree sumpathdominating path

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Relative length of longest paths and cycles in 2-connected graphs
• scientific article; zbMATH DE number 1112756
• How many disjoint 2-edge paths must a cubic graph have?
• scientific article; zbMATH DE number 3858436
• Long paths through four vertices in a 2-connected graph

Cites work

• scientific article; zbMATH DE number 3515497 (Why is no real title available?)
• scientific article; zbMATH DE number 1445365 (Why is no real title available?)
• Algorithms for long paths in graphs
• Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
• Combinatorial optimization. Theory and algorithms
• Finding a Path of Superlogarithmic Length
• Finding long paths and cycles in sparse Hamiltonian graphs
• Graph theory
• Hamiltonism, degree sum and neighborhood intersections
• Longest cycles in 3-connected graphs
• Note on Hamilton Circuits
• On Linear Time Minor Tests with Depth-First Search
• On cycles in 3-connected graphs
• Some Theorems on Abstract Graphs

Cited in

(1)

• A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks

This page was built for publication: Algorithm for two disjoint long paths in 2-connected graphs

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