Generalized DP-colorings of graphs
From MaRDI portal
Publication:6091813
DOI10.1016/j.disc.2022.113186zbMath1530.05048arXiv1908.00282OpenAlexW2966118852MaRDI QIDQ6091813
Michael Stiebitz, Alexandr V. Kostochka, Thomas Schweser
Publication date: 27 November 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.00282
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two results on the digraph chromatic number
- Ore's conjecture on color-critical graphs is almost true
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- On list critical graphs
- An extension of Brooks' theorem to n-degenerate graphs
- Color-critical graphs on a fixed surface
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs
- Colour-critical graphs with few edges
- The subchromatic number of a graph
- Partitioning and coloring graphs with degree constraints
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems
- An analogue of DP-coloring for variable degeneracy and its applications
- Generalized hypergraph coloring
- Improved lower bounds on the number of edges in list critical and online list critical graphs
- DP-degree colorable hypergraphs
- On DP-coloring of graphs and multigraphs
- On the critical point-arboricity graphs
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- A list version of Dirac's theorem on the number of edges in colour-critical graphs
- Optimal Vertex Partitions
- The number of edges in critical graphs.
- Critical Point-Arboritic Graphs
- A survey of hereditary properties of graphs
- Gallai's innequality for critical graphs of reducible hereditary properties
- Sharp Dirac's theorem for DP‐critical graphs
- Generalized list colourings of graphs
- Destroying Noncomplete Regular Components in Graph Partitions
- A note on a Brooks' type theorem for DP‐coloring
- On Partitioning Planar Graphs
- k-Degenerate Graphs
- The structure of k-chromatic graphs
- Partitions of hypergraphs under variable degeneracy constraints
