Choice Numbers of Graphs: a Probabilistic Approach

DOI10.1017/S0963548300000122MaRDI QIDQ4291205zbMATH OpenFDO

Authors Noga Alon

Publication date 10 August 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548300000122

zbMATH Keywords

choice numbercoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• The Choice Number of Dense Random Graphs
• List coloring of complete multipartite graphs
• The choice number of random bipartite graphs
• List coloring of random and pseudo-random graphs
• On the Choice Numbers of Some Complete Multipartite Graphs

Cites work

• A note on list-colorings
• Colorings and orientations of graphs
• The chromatic number of random graphs
• The strong chromatic number of a graph

Cited in

(40)

• Some results on (a:b)-choosability
• The choice number of random bipartite graphs
• A note on panchromatic colorings
• Choosability and paintability of the lexicographic product of graphs
• Comparison of sum choice number with chromatic sum
• Connectivity and choosability of graphs with no \(K_t\) minor
• The choice number versus the chromatic number for graphs embeddable on orientable surfaces
• On the subspace choosability in graphs
• Choice number of Kneser graphs
• Chain method for panchromatic colorings of hypergraphs
• Bipartite induced density in triangle-free graphs
• The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
• Coloring temporal graphs
• Bipartite graphs whose squares are not chromatic-choosable
• Incidence choosability of graphs
• Proportional choosability of complete bipartite graphs
• Partial online list coloring of graphs
• On a generalization of Rubin's theorem
• A note on list-coloring powers of graphs
• scientific article; zbMATH DE number 637317 (Why is no real title available?)
• scientific article; zbMATH DE number 1496580 (Why is no real title available?)
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• Chromatic-choosability of the power of graphs
• On the probability of independent sets in random graphs
• On-line choice number of complete multipartite graphs: an algorithmic approach
• On-line list colouring of random graphs
• The Choice Number of Dense Random Graphs
• Edge (m,k)-choosability of graphs
• Extremal problems in hypergraph colourings
• Improper choosability and property B
• Choosability with separation of complete multipartite graphs and hypergraphs
• A probabilistic counting lemma for complete graphs
• scientific article; zbMATH DE number 2188340 (Why is no real title available?)
• On the asymptotic value of the choice number of complete multi‐partite graphs
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts
• Packing list‐colorings
• Colouring complete multipartite and Kneser-type digraphs
• Colouring complete multipartite and Kneser-type digraphs (extended abstract)
• Coloring graphs from random lists
• On the choice number of complete multipartite graphs with part size four

This page was built for publication: Choice Numbers of Graphs: a Probabilistic Approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291205)