Acyclic improper choosability of subcubic graphs

Min Chen and André Raspaud

Applied Mathematics and Computation, 2019, vol. 356, issue C, 92-98

Abstract: A d-improper k-coloring of a graph G is a mapping φ:V(G)→{1,2,…,k} such that for every color i, the subgraph induced by the vertices of color i has maximum degree d. That is, every vertex can be adjacent to at most d vertices with being the same color as itself. Such a d-improper k-coloring is further said to be acyclic if for every pair of distinct colors, say i and j, the induced subgraph by the edges whose endpoints are colored with i and j is a forest. Meanwhile, we say that G is acyclically (k, d)*-colorable.

Keywords: Improper coloring; Acyclic coloring; Acyclic improper choosability; Subcubic graphs (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319302280
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:356:y:2019:i:c:p:92-98

DOI: 10.1016/j.amc.2019.03.027

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 ().