scientific article; zbMATH DE number 3563170

Cited in

(only showing first 100 items - show all)

Brooks' theorem via the Alon-Tarsi theorem
Paintability of complete bipartite graphs
A strengthening and an efficient implementation of Alon-Tarsi list coloring method
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II
Extremal jumps of the Hall number
List injective edge-coloring of subcubic graphs
Graph isomorphism restricted by lists
Colouring powers of cycles from random lists
When does the list-coloring function of a graph equal its chromatic polynomial
An algebraic approach for counting DP-3-colorings of sparse graphs
INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES
Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
The harmonic index of a graph and its DP-chromatic number
An analogue of DP-coloring for variable degeneracy and its applications
Generalized DP-colorings of graphs
On list critical graphs
Multiple list coloring of 3‐choice critical graphs
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
Choosability with union separation
List colouring of graphs and generalized Dyck paths
Extremal decompositions for Nordhaus-Gaddum theorems
The DP color function of joins and vertex-gluings of graphs
A weaker version of a conjecture on list vertex arboricity of graphs
On improperly chromatic-choosable graphs
Sum-paintability of generalized theta-graphs
The list distinguishing number equals the distinguishing number for interval graphs
Cover and variable degeneracy
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
Algorithmic complexity of list colorings
A note on 3-choosability of plane graphs under distance restrictions
Independent transversals in bipartite correspondence-covers
A generalization of some results on list coloring and DP-coloring
The DP color function of clique-gluings of graphs
Coloring squares of planar graphs with girth six
Coloring hypergraphs from random lists
DP-degree colorable hypergraphs
Computing clique and chromatic number of circular-perfect graphs in polynomial time
A vertex-splitting lemma, de Werra's theorem and improper list colourings
Planar graphs without chordal 6-cycles are 4-choosable
Improved lower bounds on the number of edges in list critical and online list critical graphs
Relation between the correspondence chromatic number and the Alon-Tarsi number
On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
On the equitable choosability of the disjoint union of stars
A precise condition for independent transversals in bipartite covers
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
Unique list colorability of the graph $K^n_2+K_r$
Interval edge-colorings of trees with restrictions on the edges
A Hajós-like theorem for list coloring
List colorings and reducibility
Edge (m,k)-choosability of graphs
Improved distributed $\Delta$-coloring
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
Planar graphs without specific cycles are 2-degenerate
Partial DP-coloring of graphs
A note on total colorings of 1-planar graphs
Sudoku number of graphs
Every planar graph without adjacent cycles of length at most 8 is 3-choosable
Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
scientific article; zbMATH DE number 7447359 (Why is no real title available?)
List homomorphism: beyond the known boundaries
A note on 3-choosability of planar graphs
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
The Alon-Tarsi number of a toroidal grid
Measurable versions of the Lovász local lemma and measurable graph colorings
A note on the minimum number of choosability of planar graphs
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Randić index and coloring number of a graph
Chromatic-choosability of the power of graphs
Maximum average degree of list-edge-critical graphs and Vizing's conjecture
Weak degeneracy of graphs
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
A short proof that the list packing number of any graph is well defined
A sufficient condition for planar graphs to be DP-4-colorable
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
Hajós' theorem for list coloring
A note on fractional DP-coloring of graphs
DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from $\{6,7,8\}$
DP‐coloring Cartesian products of graphs
Ohba's conjecture is true for graphs $K_{t+2,3,2\ast(k-t-2),1\ast t}$
On-line list coloring of matroids
DP-3-coloring of some planar graphs
Brooks' theorem with forbidden colors
Slow coloring of $3k$-connected graphs
5-list-coloring planar graphs with distant precolored vertices
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
On equitable list arboricity of graphs
3-choosability of planar graphs with $(\leqslant 4)$-cycles far apart
Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
Combinatorial Nullstellensatz and DP-coloring of graphs
DP color functions versus chromatic polynomials (II)
Coloring face hypergraphs on surfaces
Painting squares in $\Delta^2-1$ shades
scientific article; zbMATH DE number 7637228 (Why is no real title available?)
A list version of graph packing
Brooks' theorem on powers of graphs
Acyclic improper choosability of subcubic graphs
The Alon-Tarsi number of two kinds of planar graphs

This page was built for publication:

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