On the existence of a long path between specified vertices in a 2-connected graph

被引：3

作者：

Hirohata, K ^{[1
]}

机构：

[1] Keio Univ, Dept Math, Kohoku Ku, Yokohama, Kanagawa 223, Japan

来源：

GRAPHS AND COMBINATORICS | 2000年 / 16卷 / 03期

关键词：

Maximum Degree; Distinct Vertex;

D O I：

10.1007/PL00007222

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a 2-connected graph with maximum degree Delta (G) greater than or equal to 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)) greater than or equal to d for every pair of vertices u and v in V(G) - ({x, y}boolean OR W) with d(G)(u, v) = 2 Then x and y are connected by a path of length at least d - \W\.

引用

页码：269 / 273

页数：5