王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

EDGE-FACE CHROMATIC NUMBER OF 2-CONNECTED PLANE GRAPHS WITH HIGH MAXIMUM DEGREE

Hits :

First Author : 张忠辅

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2006-01-01

Document Type : 期刊

Journal : 数学物理学报(B辑)(英文版)

Issue : 第3期

Page Number : 477-482

ISSN : 0252-9602

Translation or Not : no

Key Words : 平面图;边缘面彩色数;极大度数;图论

Abstract : The edge-face chromatic number Xef (G) of a plane graph G is the least number of colors assigned to the edges and faces such that every adjacent or incident pair of them receives different colors. In this article, the authors prove that every 2-connected

Pre One : Diameters of uniform subset graphs.

Next One : Some results on distance two labelling of outerplanar graphs

Recommend this Article