Acyclic vertex coloring of graphs of maximum degree six

In this paper, we prove that every graph with maximum degree six is acyclically 10-colorable, thus improving the main result of Hervé Hocquard (2011).

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2014-06, Vol.325, p.17-22
Main Authors: Zhao, Yancai, Miao, Lianying, Pang, Shiyou, Song, Wenyao
Format: Article
Language:English
Subjects:
Acyclic coloring
Bounded degree graphs
Coloring
Graph coloring
Graphs
Mathematical analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we prove that every graph with maximum degree six is acyclically 10-colorable, thus improving the main result of Hervé Hocquard (2011).
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2014.01.022