Date of Publication:2018-01-01 Hits:
First Author:Miao, Zhengke
Date of Publication:2018-01-01
Journal:Discrete Mathematics
Affiliation of Author(s):数理与信息工程学院
Document Type:期刊
Volume:Vol.341
Issue:No.3
Page Number: 588-599
ISSN No.:0012-365X
Key Words:PLANAR;graphs;*GRAPH;coloring;*INTEGERS;*VERTICES;(Geometry);*ALGEBRAIC;cycles
Abstract:Given a nonnegative integer d and a positive integer k , a graph G is said to be ( k , d ) -colorable if the vertices of G can be colored with k colors such that every vertex has at most d neighbors receiving the same color as itself. Let ℱ be the family
Translation or Not:no