Acyclic and star coloring of P4-reducible and P4-sparse graphs

Jun Yue

Applied Mathematics and Computation, 2016, vol. 273, issue C, 68-73

Abstract: An acyclic coloring of a graph G is a proper vertex coloring such that G contains no bicolored cycles. The more restricted notion of star coloring of G is an acyclic coloring in which each path of length 3 is not bicolored. In this paper, we mainly study on the acyclic and star coloring of P4-reducible and P4-sparse graphs. Moreover, we list polynomial-time algorithms for giving an optimal acyclic or star coloring of a P4-reducible or P4-sparse graph.

Keywords: Vertex coloring; Join; Disjoint union; Cographs; P4-reducible graphs; P4-spare graphs (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315013223
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:273:y:2016:i:c:p:68-73

DOI: 10.1016/j.amc.2015.09.084

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().