Degree tolerant coloring of graph

DOI10.2478/ausi-2020-0013zbMath1476.05058OpenAlexW3135767243MaRDI QIDQ2061289

Johan Kok

Publication date: 13 December 2021

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2020-0013

zbMATH Keywords

proper coloringdefect coloringdegree tolerant chromatic numberdegree tolerant coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• A survey of Nordhaus-Gaddum type relations
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree tolerant coloring of graph