A note on defective colorings of graphs in surfaces

DOI10.1002/jgt.3190110408zbMath0654.05030OpenAlexW2040654817MaRDI QIDQ3800061

Dan S. Archdeacon

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110408

zbMATH Keywords

graph coloringcompact surface(3,k)-coloring(4,k)-colored

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (18)

Clustered colouring of graph classes with bounded treedepth or pathwidth ⋮ Unnamed Item ⋮ Globally sparse vertex‐ramsey graphs ⋮ Parameterized (Approximate) Defective Coloring ⋮ Graph partitions under average degree constraint ⋮ Sparse critical graphs for defective DP-colorings ⋮ On 2-defective DP-colorings of sparse graphs ⋮ Defective DP-colorings of sparse multigraphs ⋮ Defective DP-colorings of sparse simple graphs ⋮ Improper colouring of (random) unit disk graphs ⋮ On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number ⋮ Vertex-Coloring with Star-Defects ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ On \(t\)-relaxed 2-distant circular coloring of graphs ⋮ Defective and clustered choosability of sparse graphs ⋮ Channel assignment problem and relaxed 2-distant coloring of graphs ⋮ Defective Coloring on Classes of Perfect Graphs ⋮ Extremal results on defective colorings of graphs

This page was built for publication: A note on defective colorings of graphs in surfaces