An analogue of DP-coloring for variable degeneracy and its applications
From MaRDI portal
Publication:2062675
DOI10.7151/dmgt.2238zbMath1482.05121OpenAlexW2973622759WikidataQ127204306 ScholiaQ127204306MaRDI QIDQ2062675
Pongpat Sittitrai, Kittikorn Nakprasit
Publication date: 3 January 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2238
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Generalized DP-colorings of graphs ⋮ Variable degeneracy on toroidal graphs ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Cover and variable degeneracy ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Vertex-arboricity of planar graphs without intersecting triangles
- On the vertex-arboricity of planar graphs without 7-cycles
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- List colourings of planar graphs
- The existence of unavoidable sets of geographically good configurations
- Every planar graph is 5-choosable
- Vertex arboricity of planar graphs without intersecting 5-cycles
- A sufficient condition for DP-4-colorability
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- On DP-coloring of graphs and multigraphs
- On the vertex-arboricity of planar graphs
- Planar graphs without triangular 4-cycles are 3-choosable
- List 2-arboricity of planar graphs with no triangles at distance less than two
- The point-arboricity of a graph
- Note on a paper of B. Grünbaum on acyclic colorings
- Vertex arboricity of planar graphs without chordal 6-cycles
- LIST POINT ARBORICITY OF GRAPHS
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- A Note on the Vertex Arboricity of a Graph
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- The Point-Arboricity of Planar Graphs
This page was built for publication: An analogue of DP-coloring for variable degeneracy and its applications
