scientific article
From MaRDI portal
Publication:3922703
zbMath0469.05032MaRDI QIDQ3922703
Herbert Taylor, Arthur L. Rubin
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES ⋮ Independent transversals in bipartite correspondence-covers ⋮ The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs ⋮ Maximum average degree of list-edge-critical graphs and Vizing's conjecture ⋮ Edge (m,k)-choosability of graphs ⋮ Digraphs and Variable Degeneracy ⋮ Fractional DP-chromatic number of planar graphs of large girth ⋮ Sum-list-colouring of θ-hypergraphs ⋮ Unique list colorability of the graph Кn2 + Kr ⋮ Equitable list vertex colourability and arboricity of grids ⋮ Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph ⋮ 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 ⋮ Flexible list colorings in graphs with special degeneracy conditions ⋮ 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 ⋮ ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ ⋮ Single‐conflict colouring ⋮ Chromatic λ‐choosable and λ‐paintable graphs ⋮ Coloring bipartite graphs with semi-small list size ⋮ 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 ⋮ Sudoku number of graphs ⋮ Kempe equivalent list edge-colorings of planar 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 ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Weak dynamic coloring of planar graphs ⋮ 5-list coloring toroidal 6-regular triangulations in linear time ⋮ Multiple list coloring of 3‐choice critical graphs ⋮ The list-coloring function of signed graphs ⋮ Dirac's theorem on chordal graphs implies Brooks' theorem ⋮ Brooks' theorem with forbidden colors ⋮ On the list color function threshold ⋮ Slow coloring of \(3k\)-connected graphs ⋮ Bounding the list color function threshold from above ⋮ List homomorphism: beyond the known boundaries ⋮ The Alon-Tarsi number of two kinds of planar graphs ⋮ Extremal problems in hypergraph colourings ⋮ Refined List Version of Hadwiger’s Conjecture ⋮ The Alon-Tarsi number of a toroidal grid ⋮ On triangle-free list assignments ⋮ Packing list‐colorings ⋮ Edge-colouring graphs with local list sizes ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Flexible List Colorings in Graphs with Special Degeneracy Conditions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A note on list improper coloring planar graphs ⋮ Amenable colorings ⋮ On connected list colorings of graphs ⋮ Approximately coloring graphs without long induced paths ⋮ A local epsilon version of Reed's conjecture ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Unnamed Item ⋮ List colorings of multipartite hypergraphs ⋮ Unnamed Item ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Unnamed Item ⋮ A note on adjacent vertex distinguishing colorings of graphs ⋮ Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) ⋮ Asymmetric list sizes in bipartite graphs ⋮ \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ \(\Delta \)-list vertex coloring in linear time ⋮ A better lower bound on average degree of 4-list-critical graphs ⋮ Coloring, sparseness and girth ⋮ The 4-choosability of toroidal graphs without intersecting triangles ⋮ A \((3,1)^\ast\)-choosable theorem on planar graphs ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ Coloring immersion-free graphs ⋮ Some relations among term rank, clique number and list chromatic number of a graph ⋮ When does the list-coloring function of a graph equal its chromatic polynomial ⋮ Multiple list colouring of planar graphs ⋮ Towards a solution of the Dinitz problem? ⋮ A new upper bound for the list chromatic number ⋮ Claw-free graphs. VI: Colouring ⋮ The complexity of planar graph choosability ⋮ List homomorphisms to reflexive graphs ⋮ Dynamic list coloring of bipartite graphs ⋮ Distance constraints in graph color extensions ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ On 1-improper 2-coloring of sparse graphs ⋮ Partial list colouring of certain graphs
This page was built for publication:
