Partial DP-coloring of graphs
From MaRDI portal
Publication:2659213
DOI10.1016/j.disc.2021.112306zbMath1460.05062OpenAlexW3125927379MaRDI QIDQ2659213
Michael J. Pelsmajer, Jeffrey A. Mudrock, Hemanshu Kaul
Publication date: 25 March 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112306
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Minimum size of feedback vertex sets of planar graphs of girth at least five
- On the maximum induced forests of a connected cubic graph without triangles
- Partial list colouring of certain graphs
- The chromatic difference sequence of a graph
- DP-3-coloring of some planar graphs
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- A sufficient condition for DP-4-colorability
- A note on the DP-chromatic number of complete bipartite graphs
- Partial list colorings
- Combinatorial Nullstellensatz and DP-coloring of graphs
- On the chromatic polynomial and counting DP-colorings of graphs
- On DP-coloring of graphs and multigraphs
- DP-colorings of graphs with high chromatic number
- DP-colorings of hypergraphs
- The asymptotic behavior of the correspondence chromatic number
- A Note on Partial List Colorings
- Lower Bounds For Induced Forests in Cubic Graphs
- Sharp Dirac's theorem for DP‐critical graphs
- The Johansson‐Molloy theorem for DP‐coloring
- A note on a Brooks' type theorem for DP‐coloring
This page was built for publication: Partial DP-coloring of graphs