scientific article; zbMATH DE number 3563170
From MaRDI portal
Publication:4135588
zbMath0362.05060MaRDI QIDQ4135588
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items
INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES ⋮ Independent transversals in bipartite correspondence-covers ⋮ The asymptotic behavior of the correspondence chromatic number ⋮ Painting squares in \(\Delta^2-1\) shades ⋮ Maximum average degree of list-edge-critical graphs and Vizing's conjecture ⋮ Edge (m,k)-choosability of graphs ⋮ Some new bounds on \(T_{r}\)-choosability ⋮ Unique list colorability of the graph Кn2 + Kr ⋮ Proportional choosability of complete bipartite graphs ⋮ Partial DP-coloring of graphs ⋮ On Equitable List Arboricity of Graphs ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES ⋮ An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Weak degeneracy of graphs ⋮ DP color functions versus chromatic polynomials (II) ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ DP‐coloring Cartesian products of graphs ⋮ Girth and λ $\lambda $‐choosability of graphs ⋮ Colorings, transversals, and local sparsity ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II ⋮ Asymptotically good edge correspondence colourings ⋮ Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices ⋮ Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems ⋮ Sudoku number of graphs ⋮ A short proof that the list packing number of any graph is well defined ⋮ Generalized DP-colorings of graphs ⋮ The strong fractional choice number of 3‐choice‐critical graphs ⋮ Multiple list coloring of 3‐choice critical graphs ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ Brooks' theorem with forbidden colors ⋮ Slow coloring of \(3k\)-connected graphs ⋮ List homomorphism: beyond the known boundaries ⋮ The Alon-Tarsi number of two kinds of planar graphs ⋮ Extremal problems in hypergraph colourings ⋮ The Alon-Tarsi number of a toroidal grid ⋮ Paintability of complete bipartite graphs ⋮ A strengthening and an efficient implementation of Alon-Tarsi list coloring method ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ A note on 3-choosability of plane graphs under distance restrictions ⋮ Relation between the correspondence chromatic number and the Alon-Tarsi number ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graph isomorphism restricted by lists ⋮ List colorings of multipartite hypergraphs ⋮ Equitable colourings of Borel graphs ⋮ Extremal jumps of the Hall number ⋮ A note on the minimum number of choosability of planar graphs ⋮ Algorithmic complexity of list colorings ⋮ The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ On DP-coloring of graphs and multigraphs ⋮ DP-3-coloring of some planar graphs ⋮ Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ A new approach on locally checkable problems ⋮ A list version of graph packing ⋮ Colouring powers of cycles from random lists ⋮ Coloring complete and complete bipartite graphs from random lists ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ Hajós' theorem for list coloring ⋮ On the subspace choosability in graphs ⋮ An analysis of the parameterized complexity of periodic timetabling ⋮ A note on 3-choosability of planar graphs ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Some relations among term rank, clique number and list chromatic number of a graph ⋮ A deletion-contraction relation for the DP color function ⋮ 5-list-coloring planar graphs with distant precolored vertices ⋮ When does the list-coloring function of a graph equal its chromatic polynomial ⋮ A vertex-splitting lemma, de Werra's theorem and improper list colourings ⋮ The DP color function of joins and vertex-gluings of graphs ⋮ List colorings and reducibility ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A Hajós-like theorem for list coloring ⋮ Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ On 1-improper 2-coloring of sparse graphs ⋮ Choosability with union separation ⋮ List colouring of graphs and generalized Dyck paths ⋮ A generalization of some results on list coloring and DP-coloring ⋮ On low tree-depth decompositions ⋮ Coloring squares of planar graphs with girth six ⋮ A new lower bound on the number of edges in colour-critical graphs and hypergraphs ⋮ 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart ⋮ Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable ⋮ Generalized hypergraph coloring ⋮ A note on total colorings of 1-planar graphs ⋮ Better 3-coloring algorithms: excluding a triangle and a seven vertex path ⋮ Brooks' theorem on powers of graphs ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ 3-list-coloring graphs of girth at least five on surfaces ⋮ Chromatic-choosability of the power of graphs ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Choosability of graphs with infinite sets of forbidden differences ⋮ Sum-paintability of generalized theta-graphs ⋮ A weaker version of a conjecture on list vertex arboricity of graphs ⋮ On improperly chromatic-choosable graphs ⋮ Improved distributed \(\Delta\)-coloring ⋮ Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate ⋮ The list distinguishing number equals the distinguishing number for interval graphs ⋮ Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable ⋮ Acyclic sum-list-colouring of cylinders ⋮ List edge chromatic number of graphs with large girth ⋮ On-line list coloring of matroids ⋮ On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs ⋮ Planar graphs without chordal 6-cycles are 4-choosable ⋮ 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 ⋮ Coloring face hypergraphs on surfaces ⋮ Planar graphs are 1-relaxed, 4-choosable ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model ⋮ List coloring of Cartesian products of graphs ⋮ A note on the DP-chromatic number of complete bipartite graphs ⋮ 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 ⋮ Improved lower bounds on the number of edges in list critical and online list critical graphs ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ Planar graphs without specific cycles are 2-degenerate ⋮ Colorings of partial Steiner systems and their applications ⋮ A note on the list vertex arboricity of toroidal graphs ⋮ 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 ⋮ Randić index and coloring number of a graph ⋮ On list \(k\)-coloring convex bipartite graphs ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ 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 ⋮ 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 ⋮ Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles ⋮ Cover and variable degeneracy ⋮ Every planar graph without adjacent cycles of length at most 8 is 3-choosable ⋮ DP-4-colorability of two classes of planar graphs ⋮ The harmonic index of a graph and its DP-chromatic number ⋮ The choice number of random bipartite graphs ⋮ On list critical graphs ⋮ On the equitable choosability of the disjoint union of stars ⋮ On list edge-colorings of subcubic graphs ⋮ DP-degree colorable hypergraphs ⋮ Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles ⋮ Simultaneous coloring of edges and faces of plane graphs
This page was built for publication:
