Improper coloring of graphs on surfaces

DOI10.1002/jgt.22418zbMath1418.05062arXiv1603.02841OpenAlexW3123414474WikidataQ129076353 ScholiaQ129076353MaRDI QIDQ5379836

Louis Esperet, Ilkyoo Choi

Publication date: 14 June 2019

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

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

zbMATH Keywords

graphs on surfacesimproper coloringdefective coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (10)

Clustered colouring of graph classes with bounded treedepth or pathwidth ⋮ Clustered 3-colouring graphs of bounded degree ⋮ Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs ⋮ Clustered variants of Hajós' conjecture ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable ⋮ Parameterized (Approximate) Defective Coloring ⋮ Graph partitions under average degree constraint ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ Defective and clustered choosability of sparse graphs

This page was built for publication: Improper coloring of graphs on surfaces