Meyniel weakly triangulated graphs .2. A theorem of Dirac

被引：5

作者：

Hayward, RB

机构：

[1] Dept. of Math. and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4

来源：

DISCRETE APPLIED MATHEMATICS | 1997年 / 78卷 / 1-3期

基金：

加拿大自然科学与工程研究理事会;

关键词：

weakly triangulated graph; Meyniel graph; handle;

D O I：

10.1016/S0166-218X(97)00058-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We generalize a theorem due to Dirac and show that every Meyniel weakly trianylated graph has some vertex which is not the middle vertex of any P-5. Our main tool is a separating set notion known as a handle. (C) 1997 Elsevier Science B.V.

引用

页码：283 / 289

页数：7