EXTENDING AN EDGE-COLORING

被引：19

作者：

MARCOTTE, O ^{[1
]}

SEYMOUR, PD ^{[1
]}

机构：

[1] BELLCORE,MORRISTOWN,NJ

来源：

JOURNAL OF GRAPH THEORY | 1990年 / 14卷 / 05期

关键词：

D O I：

10.1002/jgt.3190140508

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

When can a k‐edge‐coloring of a subgraph K of a graph G be extended to a k‐edge‐coloring of G? One necessary condition is that (Formula Presented.) for all X ⊆ E(G) ‐ E(K), where μi(X) is the maximum cardinality of a subset of X whose union with the set of edges of K colored i is a matching. This condition is not sufficient in general, but is sufficient for graphs of very simple structure. We try to locate the border where sufficiency ends. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company

引用

页码：565 / 573

页数：9