A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

数学物理学报(英文版) ›› 2001, Vol. 21 ›› Issue (2): 243-248.

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

王维凡, 张克民

Department of Mathematics, Liaoning University, Shenyang 110036, China Department of Mathematics, Nanjing University, Nanjing 210093, China

出版日期:2001-04-07 发布日期:2001-04-07

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

WANG Wei-Fan, ZHANG Ke-Min

Department of Mathematics, Liaoning University, Shenyang 110036, China Department of Mathematics, Nanjing University, Nanjing 210093, China

Online:2001-04-07 Published:2001-04-07

摘要/Abstract

摘要：

Melnikov(1975) conjectured that the edges and faces of a plane graph G can be colored with (G) + 3 colors so that any two adjacent or incident elements receive distinct colors, where (G) denotes the maximum degree of G. This paper proves the conjecture for the case (G) 4.

关键词: Plane graph, chromatic number, coloring

Abstract:

Key words: Plane graph, chromatic number, coloring

中图分类号:

05C15

王维凡, 张克民. A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS[J]. 数学物理学报(英文版), 2001, 21(2): 243-248.

WANG Wei-Fan, ZHANG Ke-Min. A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS[J]. Acta mathematica scientia,Series B, 2001, 21(2): 243-248.

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

A SEVEN-COLOR THEOREM ON EDGE-FACE COLORING OF PLANE GRAPHS

PDF (PC)

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 1

Metrics

本文评价

推荐阅读 10