scientific article
From MaRDI portal
Publication:3115277
zbMath1249.90303MaRDI QIDQ3115277
Publication date: 20 February 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (64)
A subexponential algorithm for the coloured tree partition problem ⋮ List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles ⋮ The 4-choosability of toroidal graphs without intersecting triangles ⋮ Simultaneously colouring the edges and faces of plane graphs ⋮ The colour theorems of Brooks and Gallai extended ⋮ Choosability and fractional chromatic numbers ⋮ Online containers for hypergraphs, with applications to linear equations ⋮ A not 3-choosable planar graph without 3-cycles ⋮ Improper choosability of graphs of nonnegative characteristic ⋮ List edge and list total colourings of multigraphs ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ DP-colorings of graphs with high chromatic number ⋮ Choosability of planar graphs ⋮ The complexity of planar graph choosability ⋮ \(T\)-choosability in graphs ⋮ On a list-coloring problem ⋮ Application of polynomial method to on-line list colouring of graphs ⋮ Improper choosability of graphs embedded on the surface of genus \(r\) ⋮ Dense uniform hypergraphs have high list chromatic number ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Coloring graphs from random lists of size 2 ⋮ Linear choosability of graphs ⋮ Another proof of the 5-choosability of \(K_5\)-minor-free graphs ⋮ Complexity of unique list colorability ⋮ On choosability of some complete multipartite graphs and Ohba's conjecture ⋮ Upper bounds for the achromatic and coloring numbers of a graph ⋮ Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ Hall number for list colorings of graphs: Extremal results ⋮ List precoloring extension in planar graphs ⋮ Vertex coloring complete multipartite graphs from random lists of size 2 ⋮ A note on list improper coloring planar graphs ⋮ Complexity of clique coloring and related problems ⋮ Amenable colorings ⋮ A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable ⋮ Injective colorings of sparse graphs ⋮ Contractibility and the Hadwiger conjecture ⋮ Generalized list \(T\)-colorings of cycles ⋮ A relation between choosability and uniquely list colorability ⋮ List total arboricity of 2-degenerate graphs ⋮ Linear choosability of sparse graphs ⋮ The 3-choosability of plane graphs of girth 4 ⋮ Hard coloring problems in low degree planar bipartite graphs ⋮ Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) ⋮ On the choice number of complete multipartite graphs with part size four ⋮ On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ Ohba's conjecture is true for graphs with independence number at most three ⋮ Entire choosability of near-outerplane graphs ⋮ Edge choosability of planar graphs without 5-cycles with a chord ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ On \(b\)-colorings in regular graphs ⋮ Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum ⋮ Precoloring extension for 2-connected graphs with maximum degree three ⋮ Planar graphs without 3-, 7-, and 8-cycles are 3-choosable ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ On the complexity of a restricted list-coloring problem ⋮ Choosability of \(K_5\)-minor-free graphs ⋮ Complexity of choosing subsets from color sets ⋮ Edge-choosability in line-perfect multigraphs ⋮ On structure of some plane graphs with application to choosability ⋮ Graph imperfection. I ⋮ Coloring face-hypergraphs of graphs on surfaces ⋮ The 4-choosability of plane graphs without 4-cycles
This page was built for publication:
