Algorithm for two disjoint long paths in 2-connected graphs

DOI10.1016/J.TCS.2010.05.022zbMATH Open1209.05133OpenAlexW2054236110MaRDI QIDQ986559FDOQ986559

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

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

zbMATH Keywords

degree sumpathdominating path

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Note on Hamilton Circuits
• Finding a Path of Superlogarithmic Length
• Some Theorems on Abstract Graphs
• On Linear Time Minor Tests with Depth-First Search
• Title not available (Why is that?)
• Hamiltonism, degree sum and neighborhood intersections
• Longest cycles in 3-connected graphs
• On cycles in 3-connected graphs
• Combinatorial optimization. Theory and algorithms
• Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
• Title not available (Why is that?)
• Algorithms for long paths in graphs
• Finding long paths and cycles in sparse Hamiltonian 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)