王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

A sufficient condition for a planar graph to be class 1

Hits :

First Author : Weifan Wang and Yongzhu Chena

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

Date of Publication : 2007-01-01

Document Type : 期刊

Journal : Theoretical Computer Science

Volume: Vol.385

Issue : NO.1-3

Page Number : 71-77

ISSN : 0304-3975

Translation or Not : no

Key Words : Planar;graph;Edge;colouring;Chromatic;index;Cycle

Abstract : We prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle with a chord.

Pre One : 非负特征图的线性染色

Next One : Topological Indices Study of Molecular Structure in Anticancer Drugs

Recommend this Article