Degree tolerant coloring of graph

DOI10.2478/AUSI-2020-0013MaRDI QIDQ2061289zbMATH OpenOpenAlexFDO

Authors Johan Kok

Publication date 13 December 2021

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

defect coloringdegree tolerant chromatic numberdegree tolerant coloringproper coloring

Mathematics Subject Classification ID

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

Recommendations

• Rainbow degree-jump coloring of graphs
• Conditional colorings of graphs
• Degree equitable chromatic number of a graph
• scientific article; zbMATH DE number 4177084
• Coloring graphs with sparse neighborhoods

Cites work

• A survey of Nordhaus-Gaddum type relations
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Graph theory with applications
• scientific article; zbMATH DE number 3979083 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 6472631 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)

Cited in

(1)

• scientific article; zbMATH DE number 4177084 (Why is no real title available?)

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

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