Algorithm for two disjoint long paths in 2-connected graphs

Authors:
Shan Zhou;Hao Li;Guanghui Wang
Affiliations:
School of Mathematics and Statistics, Lanzhou University, 730000 Lanzhou, China and LRI, Univ Paris-sud and CNRS Orsay F-91405, France;School of Mathematics and Statistics, Lanzhou University, 730000 Lanzhou, China and LRI, Univ Paris-sud and CNRS Orsay F-91405, France;LRI, Univ Paris-sud and CNRS Orsay F-91405, France and School of Mathematics and System Science, Shandong University, 250100 Jinan, China
Venue:
Theoretical Computer Science
Year:
2010

Citing 10
Cited 0

Hamiltonism, degree sum and neighborhood intersections

Discrete Mathematics
On linear time minor tests with depth-first search

Journal of Algorithms
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Longest cycles in 3-connected graphs

Discrete Mathematics
Finding long paths and cycles in sparse Hamiltonian graphs

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An approximation algorithm for finding a long path in Hamiltonian graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Finding a Path of Superlogarithmic Length

SIAM Journal on Computing
Graph Theory With Applications

Graph Theory With Applications
Algorithms for long paths in graphs

Theoretical Computer Science
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we prove that 2-connected graphs have either a dominating path or two disjoint paths, wherein the length of the two paths is bounded by the minimum among n and a parameter defined on the neighborhood condition of any four independent vertices of the graph.