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

DOI10.1007/S40840-023-01528-9MaRDI QIDQ6173908zbMATH OpenOpenAlexFDO

Authors Pongpat Sittitrai, Keaitsuda Nakprasit, 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

discharging methodDP-coloringforest partitionplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Weak degeneracy of planar graphs without 4- and 6-cycles
• 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 5-cycles into bounded degree forests
• DP-coloring on planar graphs without given adjacent short cycles

Cites work

• \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
• An (F1,F4)‐partition of graphs with low genus and girth at least 6
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
• An analogue of DP-coloring for variable degeneracy and its applications
• Choosability and edge choosability of planar graphs without five cycles
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Cover and variable degeneracy
• Decomposition of planar graphs with forbidden configurations
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
• Defective 2-colorings of sparse graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Defective DP-colorings of sparse multigraphs
• Defective DP-colorings of sparse simple graphs
• DP-4-colorability of planar graphs without adjacent cycles of given length
• scientific article; zbMATH DE number 3565019 (Why is no real title available?)
• scientific article; zbMATH DE number 1882351 (Why is no real title available?)
• Improper choosability of graphs and maximum average degree
• Near-colorings: non-colorable graphs and NP-completeness
• On 2-defective DP-colorings of sparse graphs
• On DP-coloring of graphs and multigraphs
• On the linear vertex-arboricity of a planar graph
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• Planar graphs without cycles of specific lengths
• Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
• Planar graphs without normally adjacent short cycles
• Planar graphs without short even cycles are near-bipartite
• Planar graphs without specific cycles are 2-degenerate
• Relaxed DP-3-coloring of planar graphs without some cycles
• Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
• 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
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• The Point-Arboricity of Planar Graphs
• Threshold for path colorings of planar graphs
• Weak degeneracy of planar graphs without 4- and 6-cycles

Cited in

(5)

• Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
• A weak DP-coloring of planar graphs without 4- and 9-cycles
• Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
• \((\mathcal{F}_1, \mathcal{F})\)-partition of plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles
• An \((\mathcal{F}_3, \mathcal{F}_4)\)-partition of planar graphs without 4- and 6-cycles

This page was built for publication: A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173908)