Defective incidence coloring of graphs

•Proper incidence coloring of graphs is generalized as defective incidence coloring of graphs.•Fast algorithms for constructing the optimal defective incidence colorings of certain graphs are presented.•Relation between the 1-defective incidence (n−1)-coloring and Latin square of order n is given. W...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation Vol. 443; p. 127781
Main Authors: Bi, Huimin, Zhang, Xin
Format: Journal Article
Language:English
Published: Elsevier Inc 15.04.2023
Subjects:
Defective coloring
Incidence coloring
Latin square
Outerplanar graph
Polynomial-time algorithm
Defective coloring
Polynomial-time algorithm
Latin square
Outerplanar graph
68R10
Incidence coloring
05C15
ISSN:0096-3003, 1873-5649
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Proper incidence coloring of graphs is generalized as defective incidence coloring of graphs.•Fast algorithms for constructing the optimal defective incidence colorings of certain graphs are presented.•Relation between the 1-defective incidence (n−1)-coloring and Latin square of order n is given. 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.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2022.127781