2-Reducible Two Paths and an Edge Constructing a Path in (2::::k:::: + 1)-Edge-Connected Graphs

Haruko Okamura. 2-Reducible Two Paths and an Edge Constructing a Path in (2::::k:::: + 1)-Edge-Connected Graphs. Graphs and Combinatorics, 26(4):571-589, 2010. [doi]

Abstract

Abstract is missing.