SHORT-CHORDED AND PERFECT GRAPHS

被引：8

作者：

LUBIW, A

机构：

[1] Department of Computer Science, University of Waterloo, Waterloo

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1991年 / 51卷 / 01期

关键词：

D O I：

10.1016/0095-8956(91)90003-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is short-chroded (a.k.a. Raspail) if every odd cycle of length at least 5 has a short chord, which is a chord joining vertices distance 2 apart in the cycle. A subclass of short-chorded graphs, not contained in any of the known classes of perfect graphs, will be proved perfect. © 1991.

引用

页码：24 / 33

页数：10

共 16 条

[1] NEW CLASSES OF PERFECT GRAPHS [J].