Improper coloring of graphs on surfaces
Work
Year: 2018
Type: article
Abstract: A graph is ‐colorable if its vertex set can be partitioned into sets , such that for each , the subgraph of induced by has maximum degree at most . The Four Color Theorem states that every planar gra... more
Source: Journal of Graph Theory
Authors Ilkyoo Choi, Louis Esperet
Institutions Hankuk University of Foreign Studies, Centre National de la Recherche Scientifique, Université Grenoble Alpes
Cites: 15
Cited by: 25
Related to: 10
FWCI: 2.596
Citation percentile (by year/subfield): 92.12
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funders Agence Nationale de la Recherche, Agence Nationale de la Recherche, Agence Nationale de la Recherche, National Research Foundation of Korea, National Research Foundation of Korea
Grant IDS ANR‐11‐LABX‐0025, ANR‐13‐BS02‐0007, ANR‐16‐CE40‐0009‐01, NRF‐2018R1D1A1B07043049, NRF‐2015R1C1A1A02036398