scientific article; zbMATH DE number 1341914

zbMath1025.05030MaRDI QIDQ4263476

Margit Voigt, Zsolt Tuza, Jan Kratochvíl

Publication date: 3 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (29)

Mixed hypercacti ⋮ Path choosability of planar graphs ⋮ Sum-list-colouring of θ-hypergraphs ⋮ Mixed hypergraphs and other coloring problems ⋮ Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter ⋮ Colouring \((P_r + P_s)\)-free graphs ⋮ Partial list colouring of certain graphs ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ The Alon-Tarsi number of a toroidal grid ⋮ Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices ⋮ Unnamed Item ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ Chromatic-choosability of hypergraphs with high chromatic number ⋮ Acyclic sum-list-colouring of cylinders ⋮ Hall number for list colorings of graphs: Extremal results ⋮ Planar graphs without cycles of specific lengths ⋮ Coloring face hypergraphs on surfaces ⋮ Coloring mixed hypertrees ⋮ List coloring of Cartesian products of graphs ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ Coloring graphs from lists with bounded size of their union ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ Some results on \((a:b)\)-choosability ⋮ Colouring (P_r+P_s)-Free Graphs ⋮ Colouring H-free graphs of bounded diameter. ⋮ Incidence choosability of graphs ⋮ Color-bounded hypergraphs. I: General results ⋮ On list critical graphs ⋮ Extremal jumps of the Hall number

This page was built for publication: