scientific article; zbMATH DE number 3735847
From MaRDI portal
Publication:3922703
Recommendations
Cited in
(only showing first 100 items - show all)- An upper bound on adaptable choosability of graphs
- List coloring of graphs having cycles of length divisible by a given number
- Ohba's conjecture is true for graphs with independence number at most three
- Entire choosability of near-outerplane graphs
- Sum choice numbers of some graphs
- Some results on (a:b)-choosability
- On 3-choosable planar graphs of girth at least 4
- On \((d,1)\)-total numbers of graphs
- Precoloring extension for 2-connected graphs with maximum degree three
- On list critical graphs
- Injective colorings of planar graphs with few colors
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
- Polychromatic colorings of arbitrary rectangular partitions
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
- Towards a solution of the Dinitz problem?
- A new upper bound for the list chromatic number
- The complexity of planar graph choosability
- List homomorphisms to reflexive graphs
- \(T\)-colorings of graphs: recent results and open problems
- Some results concerning the complexity of restricted colorings of graphs
- List edge chromatic number of graphs with large girth
- You can't paint yourself into a corner
- The list chromatic numbers of some planar graphs
- The Hall number, the Hall index, and the total Hall number of a graph
- The choice number of random bipartite graphs
- On the complexity of a restricted list-coloring problem
- Edge-choosability in line-perfect multigraphs
- The 4-choosability of plane graphs without 4-cycles
- List T-colorings of graphs
- Simultaneous coloring of edges and faces of plane graphs
- Algorithmic complexity of list colorings
- Complexity of list coloring problems with a fixed total number of colors
- The colour theorems of Brooks and Gallai extended
- Choosability and fractional chromatic numbers
- Choice number of 3-colorable elementary graphs
- On the number of even and odd Latin squares of order \(p+1\)
- Generalized coloring for tree-like graphs
- List edge and list total colourings of multigraphs
- Color-critical graphs on a fixed surface
- Some results on list \(T\)-colourings
- \(T\)-choosability in graphs
- On a list-coloring problem
- Improper choosability of graphs embedded on the surface of genus r
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs
- On list edge-colorings of subcubic graphs
- Choosability of K₅-minor-free graphs
- Complexity of choosing subsets from color sets
- DP-3-coloring of some planar graphs
- Path choosability of planar graphs
- Choice numbers of multi-bridge graphs
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Extension from precoloured sets of edges
- A new sufficient condition for a toroidal graph to be 4-choosable
- Dynamic coloring parameters for graphs with given genus
- Choosability with union separation
- A note on panchromatic colorings
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
- List colouring of graphs and generalized Dyck paths
- Online sum-paintability: the slow-coloring game
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
- On (k, k n - k^2 - 2 k - 1)-choosability of n-vertex graphs
- Planar graphs without chordal 6-cycles are 4-choosable
- A better lower bound on average degree of online \(k\)-list-critical graphs
- Total equitable list coloring
- Generalized list \(T\)-colorings of cycles
- The 3-choosability of plane graphs of girth 4
- A note on the DP-chromatic number of complete bipartite graphs
- A note on the list vertex arboricity of toroidal graphs
- Interval vertex-coloring of a graph with forbidden colors
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- Choosability, edge choosability and total choosability of outerplane graphs
- On structure of some plane graphs with application to choosability
- Graph imperfection. I
- Coloring face-hypergraphs of graphs on surfaces
- Edge dominating set and colorings on graphs with fixed clique-width
- Three-coloring Klein bottle graphs of girth five
- The edge-face choosability of plane graphs
- Colouring powers of cycles from random lists
- Hajós' theorem for list coloring
- On the Dinitz conjecture and related conjectures
- An exchange property of matroids
- Choosability of planar graphs
- A Hajós-like theorem for list coloring
- Improved distributed \(\Delta\)-coloring
- The 4-choosability of planar graphs and cycle adjacency
- 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
- 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
- DP-3-coloring of planar graphs without certain cycles
- Nonrepetitive list colorings of the integers
- Injective edge-coloring of graphs with given maximum degree
- 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
- The trouble with the second quantifier
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 Q3922703)
