caa a22 4500 475778065 CHVBK 20180406123636.0 cr unu---uuuuu 170329e20000901xx s 000 0 eng 10.1007/PL00007222 doi (NATIONALLICENCE)springer-10.1007/PL00007222 Hirohata Kazuhide Department of Mathematics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, Yokohama 223, Japan. e-mail: hirohata@comb.math.keio.ac.jp, JP aut On the Existence of a Long Path Between Specified Vertices in a 2-Connected Graph [Elektronische Daten] [Kazuhide Hirohata] Abstract.:  Let G be a 2-connected graph with maximum degree Δ (G)≥d, and let x and y be distinct vertices of G. Let W be a subset of V(G)−{x, y} with cardinality at most d−1. Suppose that max{d G(u), d G(v)}≥d for every pair of vertices u and v in V(G)−({x, y}∪W) with d G(u,v)=2. Then x and y are connected by a path of length at least d−|W|. Springer-Verlag Tokyo, 2000 https://doi.org/10.1007/PL00007222 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/PL00007222 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Hirohata Kazuhide Department of Mathematics, Keio University, 3-14-1 Hiyoshi, Kohoku-ku, Yokohama 223, Japan. e-mail: hirohata@comb.math.keio.ac.jp, JP aut Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer