Acyclic vertex coloring of graphs of maximum degree 5

被引：8

作者：

Yadav, Kishore ^{[1
]}

Varagani, Satish ^{[1
,2
]}

Kothapalli, Kishore ^{[1
]}

Venkaiah, V. Ch. ^{[2
]}

机构：

[1] Int Inst Informat Technol, Hyderabad, Andhra Pradesh, India

[2] CR Rao Adv Inst Math Stat & Comp Sci, Hyderabad, Andhra Pradesh, India

来源：

DISCRETE MATHEMATICS | 2011年 / 311卷 / 05期

关键词：

Graph coloring; Acyclic coloring; Bounded degree graphs; Algorithms; PLANAR GRAPHS;

D O I：

10.1016/j.disc.2010.10.024

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic vertex coloring of graph G. For a family F of graphs, the acyclic chromatic number of F, denoted by a(F), is defined as the maximum a(G) over all the graphs G epsilon F. In this paper we show that a(F) = 8 where F is the family of graphs of maximum degree 5 and give a linear time algorithm to achieve this bound. (C) 2010 Elsevier B.V. All rights reserved.

引用

页码：342 / 348

页数：7

共 50 条

[1] Acyclic vertex coloring of graphs of maximum degree six
Zhao, Yancai
Miao, Lianying
Pang, Shiyou
Song, Wenyao
[J]. DISCRETE MATHEMATICS, 2014, 325 : 17 - 22
[2] Acyclic Coloring of Graphs with Maximum Degree 7
Wang, Juan
Miao, Lianying
Song, Wenyao
Liu, Yunlong
[J]. GRAPHS AND COMBINATORICS, 2021, 37 (02) : 455 - 469
[3] Acyclic Coloring of Graphs with Maximum Degree 7
Juan Wang
Lianying Miao
Wenyao Song
Yunlong Liu
[J]. Graphs and Combinatorics, 2021, 37 : 455 - 469
[4] Acyclic coloring of graphs with maximum degree at most six
Wang, Juan
Miao, Lianying
[J]. DISCRETE MATHEMATICS, 2019, 342 (11) : 3025 - 3033
[5] Acyclic Edge Coloring of Graphs with Maximum Degree 4
Basavaraju, Manu
Chandran, L. Sunill
[J]. JOURNAL OF GRAPH THEORY, 2009, 61 (03) : 192 - 209
[6] Acyclic Coloring of 5-regularless Graphs with Maximum Degree 5 with Seven Colors
Salehi-Zarrin-Ghabaei, Ahmad
Rostami, Reza
[J]. ICMS: INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCE, 2010, 1309 : 814 - +
[7] Acyclic coloring of graphs of maximum degree five: Nine colors are enough
Fertin, Guillaume
Raspaud, Andre
[J]. INFORMATION PROCESSING LETTERS, 2007, 105 (02) : 65 - 72
[8] Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
Hocquard, Herve
Montassier, Mickael
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (01) : 152 - 160
[9] Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
Lu, You
Li, Jiaao
Luo, Rong
Miao, Zhengke
[J]. DISCRETE MATHEMATICS, 2017, 340 (02) : 119 - 123
[10] Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ
Hervé Hocquard
Mickaël Montassier
[J]. Journal of Combinatorial Optimization, 2013, 26 : 152 - 160

← 1 2 3 4 5 →