A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable
type: Item
instance of: scholarly article
title: A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable
zbMATH Open document ID: 1545.05082
DOI: 10.1016/j.amc.2024.128706
author: Ganchao Zhang
author: Min Chen
author: Weifan Wang
published in: Applied Mathematics and Computation
publication date: 2024-08-12T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7894932
zbMATH Keywords: improper coloring
zbMATH Keywords: planar graphs
zbMATH Keywords: cycle
zbMATH Keywords: discharging method
MaRDI profile type: MaRDI publication profile
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
cites work: Defective 2-colorings of sparse graphs
cites work: (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
cites work: Planar graphs with girth at least 5 are \((3, 5)\)-colorable
cites work: Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
cites work: Planar graphs with girth at least 5 are \((3, 4)\)-colorable
cites work: Improper choosability of graphs and maximum average degree
cites work: Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
cites work: Every planar graph with girth at least 5 is \((1,9)\)-colorable
cites work: Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
cites work: Near-colorings: non-colorable graphs and NP-completeness
cites work: On the vertex partition of planar graphs into forests with bounded degree
cites work: Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
cites work: On $(3,1)^*$-Coloring of Plane Graphs
cites work: Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
cites work: A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
cites work: Q4230860
cites work: List Improper Colourings of Planar Graphs
description: scientific article; zbMATH DE number 7894932