scientific article; zbMATH DE number 3563170

zbMATH Open0362.05060MaRDI QIDQ4135588FDOQ4135588

Authors: V. G. Vizing

Publication date: 1976

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Relations of low-dimensional topology with graph theory (57M15)

Cited In (only showing first 100 items - show all)

Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
Every planar graph without adjacent cycles of length at most 8 is 3-choosable
A note on 3-choosability of planar graphs
Maximum average degree of list-edge-critical graphs and Vizing's conjecture
A short proof that the list packing number of any graph is well defined
A note on the minimum number of choosability of planar graphs
Randić index and coloring number of a graph
Chromatic-choosability of the power of graphs
A sufficient condition for planar graphs to be DP-4-colorable
Hajós' theorem for list coloring
DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from $\{6,7,8\}$
On equitable list arboricity 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
3-choosability of planar graphs with $(\leqslant 4)$-cycles far apart
Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
5-list-coloring planar graphs with distant precolored vertices
Title not available (Why is that?)
Coloring face hypergraphs on surfaces
Brooks' theorem on powers of graphs
A list version of graph packing
On list edge-colorings of subcubic graphs
Some relations among term rank, clique number and list chromatic number of a graph
List edge chromatic number of graphs with large girth
Simultaneous coloring of edges and faces of plane graphs
Coloring complete and complete bipartite graphs from random lists
A note on total and list edge-colouring of graphs of tree-width 3
On list $k$-coloring convex bipartite graphs
On 1-improper 2-coloring of sparse graphs
A note on the list vertex arboricity of toroidal graphs
List coloring of Cartesian products of graphs
Planar graphs are 1-relaxed, 4-choosable
Colorings of partial Steiner systems and their applications
Vertex-arboricity of toroidal graphs without $K_5^-$ and $6$-cycles
On DP-coloring of graphs and multigraphs
Facially-constrained colorings of plane graphs: a survey
An analysis of the parameterized complexity of periodic timetabling
The choice number of random bipartite graphs
The asymptotic behavior of the correspondence chromatic number
The choice number versus the chromatic number for graphs embeddable on orientable surfaces
A $(3,1)^\ast$-choosable theorem on planar graphs
On low tree-depth decompositions
3-list-coloring graphs of girth at least five on surfaces
Extremal jumps of the Hall number
Brooks' theorem via the Alon-Tarsi theorem
Colouring powers of cycles from random lists
When does the list-coloring function of a graph equal its chromatic polynomial
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
On list critical 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
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Independent transversals in bipartite correspondence-covers
A note on 3-choosability of plane graphs under distance restrictions
Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
Algorithmic complexity of list colorings
Coloring squares of planar graphs with girth six
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
Computing clique and chromatic number of circular-perfect graphs in polynomial time
Interval edge-colorings of trees with restrictions on the edges
On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
A Hajós-like theorem for list coloring
List colorings and reducibility
A note on total colorings of 1-planar graphs
Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
Weak degeneracy of graphs
Measurable versions of the Lovász local lemma and measurable graph colorings
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
DP-3-coloring of some planar graphs
DP color functions versus chromatic polynomials (II)
Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
Combinatorial Nullstellensatz and DP-coloring of graphs
The Alon-Tarsi number of two kinds of planar graphs
Acyclic improper choosability of subcubic graphs
Two sufficient conditions for a planar graph to be list vertex-2-arborable
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
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
On $(k, k n - k^2 - 2 k - 1)$-choosability of $n$-vertex graphs
Extremal problems in hypergraph colourings
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
Generalized hypergraph coloring
DP-4-colorability of planar graphs without adjacent cycles of given length
A deletion-contraction relation for the DP color function
DP-4-colorability of two classes of planar graphs
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
A note on the DP-chromatic number of complete bipartite 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)