王维凡

professor  

Gender : Male

Alma Mater : 南京大学

Education Level : Graduate student graduate

Degree : Doctorate

Status : 退休

School/Department : 数学科学学院

Date of Employment : 2002-05-01


Paper achievements

Edge-partition and star chromatic index

Hits :

First Author : Yiqiao Wang

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

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Applied Mathematics and Computation

Volume: Vol.333

Page Number : 480-489

ISSN : 0096-3003

Translation or Not : no

Key Words : Star;chromatic;index;Strong;chromatic;index;Planar;graph;Outerplanar;graph;Edge-partition

Abstract : The star chromatic index     of a graph G is the smallest integer k for which G has a proper edge k -coloring without bichromatic paths or cycles of length four. The strong chromatic index     of G is the smallest integer k for which G has a proper edge k

Pre One : The 2-surviving rate of planar graphs without 5-cycles

Next One : A sufficient condition for a tree to be \((\Delta +1)\) - \((2,1)\) -totally labelable

Recommend this Article