Defective incidence coloring of graphs

DOI10.1016/j.amc.2022.127781OpenAlexW4313543248MaRDI QIDQ2700419

Xin Zhang, Huimin Bi

Publication date: 21 April 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.03732

zbMATH Keywords

polynomial-time algorithmLatin squareouterplanar graphincidence coloringdefective coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Hypergraph incidence coloring

Cites Work

• Erratum to [``The incidence game chromatic number, Discrete Appl. Math. 157, No.\,9, 1980--1987 (2009; Zbl 1169.05321)]
• On certain constructions for latin squares with no latin subsquares of order two
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• Oriented incidence colourings of digraphs
• The star arboricity of graphs
• Incidence coloring of mycielskians with fast algorithm
• Incidence choosability of graphs
• Interval incidence coloring of bipartite graphs
• The incidence game chromatic number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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