scientific article; zbMATH DE number 3563170

Cited in

(only showing first 100 items - show all)

On list critical graphs
List edge chromatic number of graphs with large girth
The choice number of random bipartite graphs
Simultaneous coloring of edges and faces of plane graphs
Algorithmic complexity of list colorings
A vertex-splitting lemma, de Werra's theorem and improper list colourings
List colorings and reducibility
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
On list edge-colorings of subcubic graphs
DP-3-coloring of some planar graphs
Choosability with union separation
List colouring of graphs and generalized Dyck paths
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
On (k, k n - k^2 - 2 k - 1)-choosability of n-vertex graphs
Planar graphs without chordal 6-cycles are 4-choosable
A note on the DP-chromatic number of complete bipartite graphs
A note on the list vertex arboricity of toroidal graphs
Colouring powers of cycles from random lists
Hajós' theorem for list coloring
A Hajós-like theorem for list coloring
Improved distributed \(\Delta\)-coloring
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
Combinatorial Nullstellensatz and DP-coloring of graphs
Acyclic improper choosability of subcubic graphs
A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model
Choosability and paintability of the lexicographic product of graphs
Answers to two questions on the DP color function
Majority colorings of sparse digraphs
Differences between the list-coloring and DP-coloring for planar graphs
Injective edge-coloring of graphs with given maximum degree
Planar graphs without specific cycles are 2-degenerate
A note on the equitable choosability of complete bipartite graphs
On list equitable total colorings of the generalized theta graph
List injective edge-coloring of subcubic graphs
On list \(k\)-coloring convex bipartite graphs
An analogue of DP-coloring for variable degeneracy and its applications
Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles
Cover and variable degeneracy
On the equitable choosability of the disjoint union of stars
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
The choice number versus the chromatic number for graphs embeddable on orientable surfaces
Two sufficient conditions for a planar graph to be list vertex-2-arborable
A new approach on locally checkable problems
On the subspace choosability in graphs
An analysis of the parameterized complexity of periodic timetabling
A deletion-contraction relation for the DP color function
The DP color function of joins and vertex-gluings of graphs
A generalization of some results on list coloring and DP-coloring
Generalized hypergraph coloring
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
On the chromatic polynomial and counting DP-colorings of graphs
3-list-coloring graphs of girth at least five on surfaces
Acyclic sum-list-colouring of cylinders
Improved lower bounds on the number of edges in list critical and online list critical graphs
DP-4-colorability of planar graphs without adjacent cycles of given length
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Measurable versions of the Lovász local lemma and measurable graph colorings
Every planar graph without adjacent cycles of length at most 8 is 3-choosable
DP-4-colorability of two classes of planar graphs
DP-degree colorable hypergraphs
On DP-coloring of graphs and multigraphs
A note on 3-choosability of planar graphs
Facially-constrained colorings of plane graphs: a survey
Coloring squares of planar graphs with girth six
3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
A note on total colorings of 1-planar graphs
Brooks' theorem on powers of graphs
Choosability of graphs with infinite sets of forbidden differences
List coloring of Cartesian products of graphs
Colorings of partial Steiner systems and their applications
The asymptotic behavior of the correspondence chromatic number
Painting squares in \(\Delta^2-1\) shades
Some new bounds on \(T_{r}\)-choosability
Proportional choosability of complete bipartite graphs
Partial DP-coloring of graphs
A note on the minimum number of choosability of planar graphs
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
Relation between the correspondence chromatic number and the Alon-Tarsi number
Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
A list version of graph packing
Coloring complete and complete bipartite graphs from random lists
A note on total and list edge-colouring of graphs of tree-width 3
Planar graphs with 8 are (+1)-edge-choosable
A note on 3-choosability of plane graphs under distance restrictions
A \((3,1)^\ast\)-choosable theorem on planar graphs
scientific article; zbMATH DE number 7447359 (Why is no real title available?)
Extremal jumps of the Hall number
5-list-coloring planar graphs with distant precolored vertices
When does the list-coloring function of a graph equal its chromatic polynomial
Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems
Computing clique and chromatic number of circular-perfect graphs in polynomial time
On 1-improper 2-coloring of sparse graphs
Chromatic-choosability of the power of graphs
Sum-paintability of generalized theta-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)