Defective incidence coloring of graphs

DOI10.1016/J.AMC.2022.127781arXiv2202.03732MaRDI QIDQ6390470

Publication date: 8 February 2022

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.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

This page was built for publication: Defective incidence coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6390470)