A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles

DOI10.1007/s40840-023-01528-9zbMath1518.05156MaRDI QIDQ6173908

Keaitsuda Maneeruk Nakprasit, Pongpat Sittitrai, Kittikorn Nakprasit

Publication date: 13 July 2023

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-023-01528-9

zbMATH Keywords

planar graphs; discharging method; DP-coloring; forest partition

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

Related Items

A weak DP-coloring of planar graphs without 4- and 9-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Planar graphs without cycles of specific lengths
• Planar graphs without short even cycles are near-bipartite
• Choosability and edge choosability of planar graphs without five cycles
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
• Planar graphs without specific cycles are 2-degenerate
• An analogue of DP-coloring for variable degeneracy and its applications
• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
• Cover and variable degeneracy
• Relaxed DP-3-coloring of planar graphs without some cycles
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
• Planar graphs without normally adjacent short cycles
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• On 2-defective DP-colorings of sparse graphs
• Defective DP-colorings of sparse multigraphs
• Defective DP-colorings of sparse simple graphs
• Near-colorings: non-colorable graphs and NP-completeness
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• DP-4-colorability of planar graphs without adjacent cycles of given length
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• On DP-coloring of graphs and multigraphs
• Defective 2-colorings of sparse graphs
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• Decomposition of planar graphs with forbidden configurations
• On the linear vertex-arboricity of a planar graph
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Improper choosability of graphs and maximum average degree
• The Point-Arboricity of Planar Graphs
• Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
• An (F1,F4)‐partition of graphs with low genus and girth at least 6
• Weak degeneracy of planar graphs without 4- and 6-cycles