A NOTE ON N-EXTENDIBLE GRAPHS

被引：7

作者：

YU, QL ^{[1
]}

机构：

[1] SIMON FRASER UNIV,DEPT MATH & STAT,BURNABY V5A 1S6,BC,CANADA

来源：

JOURNAL OF GRAPH THEORY | 1992年 / 16卷 / 04期

关键词：

D O I：

10.1002/jgt.3190160408

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G having a perfect matching is called n-extendable if every matching of size n of G can be extended to a perfect matching. In this note, we show that if G is an n-extendable nonbipartite graph, then G + e is (n - 1)-extendable for any edge e is-an-element-of E(GBAR).

引用

页码：349 / 353

页数：5

共 9 条

[1]

Chartrand Gary, 2016, GRAPHS DIGRAPHS, VSixth, DOI DOI 10.1201/B19731

[2]

GYORI E, IN PRESS DISCRETE MA

[3] DEFECT-D MATCHINGS IN GRAPHS [J].

LITTLE, CHC ;

GRANT, DD ;

HOLTON, DA .

DISCRETE MATHEMATICS, 1975, 13 (01) :41-54

[4]

Lovasz L., 1986, MATCHING THEORY

[5]

Plummer M. D., 1988, C NUMER, V63, P147

[6] ON N-EXTENDABLE GRAPHS [J].

PLUMMER, MD .

DISCRETE MATHEMATICS, 1980, 31 (02) :201-210

[7]

SAITO A, COMMUNICATION

[8]

SAITO A, 1989, DISCRETE MATH, V79, P109

[9]

YU QL, IN PRESS AUSTR J COM

← 1 →