Every planar graph with maximum degree 7 is of class 1

被引：87

作者：

Zhang, LM ^{[1
]}

机构：

[1] Inst Informat Engn, Dept Appl Math, Zhengzhou 450002, Henan, Peoples R China

来源：

GRAPHS AND COMBINATORICS | 2000年 / 16卷 / 04期

关键词：

Planar Graph; Maximum Degree;

D O I：

10.1007/s003730070009

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

V.G. Vizing conjectured in 1968 that every planar graph with maximum degree 6 or 7 is of class 1. This paper shows that, for planar graphs with maximum degree 7, Vizing's conjecture is true.

引用

页码：467 / 495

页数：29

共 8 条

[1] [Anonymous], 1968, USPEKHIMAT NAUK
[2] Bondy J.A., 2008, GRAD TEXTS MATH
[3] FIORINI S, 1978, SELECTED TOPICS GRAP, V1, P104
[4] GOLDBERG MK, 1984, J GRAPH THEOR, V8, P121
[5] ON THE CHROMATIC INDEX OF MULTIGRAPHS WITHOUT LARGE TRIANGLES
KIERSTEAD, HA
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 36 (02) : 156 - 160
[6] Vizing V. G., 1965, Diskret. Analiz, V5, P9
[7] Vizing V. G., 1964, Metody Diskretnogo Analiza, V3, P25, DOI 10.1515/crll.1964.216.25
[8] YAP HP, 1976, SOME TOPICS GRAPH TH

← 1 →