| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 439034 | Theoretical Computer Science | 2010 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
