scientific article; zbMATH DE number 3563170

Cited in

(only showing first 100 items - show all)

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
Two sufficient conditions for a planar graph to be list vertex-2-arborable
Injective chromatic index of $K_4$-minor free graphs
On list edge-colorings of subcubic graphs
An improved lower bound of $P(G,L)-P(G,k)$ for $k$-assignments $L$
Some relations among term rank, clique number and list chromatic number of a graph
scientific article; zbMATH DE number 7790331 (Why is no real title available?)
Colorings, transversals, and local sparsity
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
Choosability of graphs with infinite sets of forbidden differences
List edge chromatic number of graphs with large girth
A new approach on locally checkable problems
A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model
Coloring complete and complete bipartite graphs from random lists
On (k, k n - k^2 - 2 k - 1)-choosability of n-vertex graphs
Simultaneous coloring of edges and faces of plane graphs
Equitable colourings of Borel graphs
A note on total and list edge-colouring of graphs of tree-width 3
On 1-improper 2-coloring of sparse graphs
On list $k$-coloring convex bipartite graphs
Acyclic sum-list-colouring of cylinders
A note on the list vertex arboricity of toroidal graphs
List coloring of Cartesian products of graphs
Extremal problems in hypergraph colourings
Planar graphs are 1-relaxed, 4-choosable
On the subspace choosability in graphs
Choosability and paintability of the lexicographic product of graphs
Answers to two questions on the DP color function
Majority colorings of sparse digraphs
Colorings of partial Steiner systems and their applications
Vertex-arboricity of toroidal graphs without $K_5^-$ and $6$-cycles
List colorings of multipartite hypergraphs
Generalized hypergraph coloring
DP-4-colorability of planar graphs without adjacent cycles of given length
On DP-coloring of graphs and multigraphs
A deletion-contraction relation for the DP color function
Facially-constrained colorings of plane graphs: a survey
DP-4-colorability of two classes of planar graphs
An analysis of the parameterized complexity of periodic timetabling
On the chromatic polynomial and counting DP-colorings of graphs
Differences between the list-coloring and DP-coloring for planar graphs
Injective edge-coloring of graphs with given maximum degree
The choice number of random bipartite graphs
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
The asymptotic behavior of the correspondence chromatic number
A $(3,1)^\ast$-choosable theorem on planar graphs
The choice number versus the chromatic number for graphs embeddable on orientable surfaces
Asymptotically good edge correspondence colourings
Proportional choosability of complete bipartite graphs
A note on the DP-chromatic number of complete bipartite graphs
A note on the equitable choosability of complete bipartite graphs
On list equitable total colorings of the generalized theta graph
Some new bounds on $T_{r}$-choosability
The strong fractional choice number of 3‐choice‐critical graphs
On low tree-depth decompositions
Girth and λ $\lambda $‐choosability of graphs
3-list-coloring graphs of girth at least five on surfaces

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)