Incidence coloring of Mycielskians with fast algorithm

Defective incidence coloring of graphs

“…The incidence coloring of graphs, introduced by Brualdi and Quinn Massey [7] in 1993, has been attracting attention of many researchers (see an online survey of Sopena [15] for the recent progresses of the study of the incidence coloring). This coloring has many applications in theoretical computer science and information science as it can model the multi-frequency assignment problem where each transceiver can be simultaneously in sending and receiving modes [6].…”

Hypergraph incidence coloring

“…In the literature, many topics concerning the incidence coloring of graphs were investigated, including incidence coloring of certain graph classes [6-8, 13, 14, 20, 21, 26, 29, 32], incidence choosability [3], interval incidence coloring [25], fractional incidence coloring [36], incidence coloring game [1], digraph incidence coloring [15], the complexity of the incidence coloring [27], and the application of incidence coloring to multi-frequency assignment problems [6]. To our knowledge, there is no publication concerning the incidence coloring of hypergraphs.…”