王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

Acyclic edge coloring of planar graphs without 4-cycles

Hits :

First Author : Weifan Wang

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

Date of Publication : 2013-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.25

Issue : No.4

Page Number : 562-586

ISSN : 1382-6905

Translation or Not : no

Key Words : Acyclic;edge;coloring;Planar;graph;Cycle;Maximum;degree

Abstract : An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a′(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. Fiamčik (Math. Slovaca

Pre One : 最大度为3的树的L(2,1)-标号数的一个刻画

Next One : Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4

Recommend this Article