TCS Journal 2010 Journal Article
Algorithm for two disjoint long paths in 2 -connected graphs
- Shan Zhou
- Hao Li
- Guanghui Wang
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.