Defective incidence coloring of graphs

Huimin Bi; Xin Zhang

Defective incidence coloring of graphs

Combinatorics 2022-02-09 v1 Discrete Mathematics

Authors: Huimin Bi , Xin Zhang

Abstract

We define the $d$ -defective incidence chromatic number of a graph, generalizing the notion of incidence chromatic number, and determine it for some classes of graphs including trees, complete bipartite graphs, complete graphs, and outerplanar graphs. Fast algorithms for constructing the optimal $d$ -defective incidence colorings of those graphs are presented.

Keywords

incidence coloring defective coloring graph coloring h-chromatic number trees outerplanar graphs algorithm

Cite

@article{arxiv.2202.03732,
  title  = {Defective incidence coloring of graphs},
  author = {Huimin Bi and Xin Zhang},
  journal= {arXiv preprint arXiv:2202.03732},
  year   = {2022}
}

Comments

20 pages, 4 figures

Related papers

View all related →