Choice Numbers of Graphs: a Probabilistic Approach

From MaRDI portal
Revision as of 18:56, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4291205

DOI10.1017/S0963548300000122zbMath0793.05076MaRDI QIDQ4291205

Noga Alon

Publication date: 10 August 1994

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




Related Items (29)

The choice number versus the chromatic number for graphs embeddable on orientable surfacesOn the probability of independent sets in random graphsEdge (m,k)-choosability of graphsProportional choosability of complete bipartite graphsImproper Choosability and Property BChain method for panchromatic colorings of hypergraphsBipartite induced density in triangle-free graphsA note on list-coloring powers of graphsA note on panchromatic coloringsThe list-chromatic number of complete multipartite hypergraphs and multiple covers by independent setsExtremal problems in hypergraph colouringsPacking list‐coloringsBeyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) verticesChromatic-choosability of the power of graphsOn-line choice number of complete multipartite graphs: an algorithmic approachOn-line list colouring of random graphsColoring temporal graphsNordhaus–Gaddum‐type Theorems for decompositions into many partsOn a generalization of Rubin's theoremChoosability with Separation of Complete Multipartite Graphs and HypergraphsBipartite graphs whose squares are not chromatic-choosableChoosability and paintability of the lexicographic product of graphsComparison of sum choice number with chromatic sumOn the choice number of complete multipartite graphs with part size fourOn the asymptotic value of the choice number of complete multi‐partite graphsSome results on \((a:b)\)-choosabilityThe choice number of random bipartite graphsConnectivity and choosability of graphs with no \(K_t\) minorPartial Online List Coloring of Graphs



Cites Work


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