The Johansson‐Molloy theorem for DP‐coloring
From MaRDI portal
Publication:5229335
DOI10.1002/rsa.20811zbMath1417.05059arXiv1708.03843OpenAlexW3099475586MaRDI QIDQ5229335
Publication date: 14 August 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.03843
Related Items (24)
Colouring graphs with forbidden bipartite subgraphs ⋮ Independent transversals in bipartite correspondence-covers ⋮ The list chromatic number of graphs with small clique number ⋮ A deletion-contraction relation for the DP color function ⋮ The $\chi$-Ramsey Problem for Triangle-Free Graphs ⋮ The DP color function of joins and vertex-gluings of graphs ⋮ Partial DP-coloring of graphs ⋮ Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques ⋮ Counting colorings of triangle-free graphs ⋮ Asymptotically good edge correspondence colourings ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Extremal bipartite independence number and balanced coloring ⋮ Variable degeneracy on toroidal graphs ⋮ On triangle-free list assignments ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ Unnamed Item ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ Answers to two questions on the DP color function ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ Cover and variable degeneracy
This page was built for publication: The Johansson‐Molloy theorem for DP‐coloring
