A note on dominating cycles in 2-connected graphs

被引：2
|
作者：
Bauer, D
Schmeichel, E
Veldman, HJ
机构：
[1] STEVENS INST TECHNOL,DEPT MATH,HOBOKEN,NJ 07030
[2] SAN JOSE STATE UNIV,DEPT MATH & COMP SCI,SAN JOSE,CA 95192
[3] UNIV TWENTE,FAC APPL MATH,NL-7500 AE ENSCHEDE,NETHERLANDS
来源：
DISCRETE MATHEMATICS | 1996年 / 155卷 / 1-3期
基金：
美国国家科学基金会;
关键词：
D O I：
10.1016/0012-365X(94)00364-O
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let G be a 2-connected graph on n vertices such that d(x) + d(y) + d(z) greater than or equal to n for all triples of independent vertices x,y,z. We prove that every longest cycle in G is a dominating cycle unless G is a spanning subgraph of a graph belonging to one of four easily specified classes of graphs.
引用
收藏
页码：13 / 18
页数：6
相关论文
共 50 条
12345