Publication:3115277
From MaRDI portal
zbMath1249.90303MaRDI QIDQ3115277
Publication date: 20 February 2012
90C35: Programming involving graphs or networks
Related Items
A note on list improper coloring planar graphs, Amenable colorings, Injective colorings of sparse graphs, Contractibility and the Hadwiger conjecture, The 4-choosability of toroidal graphs without intersecting triangles, Linear choosability of graphs, Another proof of the 5-choosability of \(K_5\)-minor-free graphs, Complexity of unique list colorability, Hall number for list colorings of graphs: Extremal results, A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable, Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\), 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, Precoloring extension for 2-connected graphs with maximum degree three, Planar graphs without 3-, 7-, and 8-cycles are 3-choosable, The complexity of planar graph choosability, On the complexity of a restricted list-coloring problem, Edge-choosability in line-perfect multigraphs, The 4-choosability of plane graphs without 4-cycles, Simultaneously colouring the edges and faces of plane graphs, The colour theorems of Brooks and Gallai extended, Choosability and fractional chromatic numbers, List edge and list total colourings of multigraphs, \(T\)-choosability in graphs, On a list-coloring problem, Improper choosability of graphs embedded on the surface of genus \(r\), Choosability of \(K_5\)-minor-free graphs, Complexity of choosing subsets from color sets, Generalized list \(T\)-colorings of cycles, The 3-choosability of plane graphs of girth 4, 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, A not 3-choosable planar graph without 3-cycles, Choosability of planar graphs, A subexponential algorithm for the coloured tree partition problem, Improper choosability of graphs of nonnegative characteristic, On choosability of some complete multipartite graphs and Ohba's conjecture, A relation between choosability and uniquely list colorability, Hard coloring problems in low degree planar bipartite graphs
