Pages that link to "Item:Q4291205"
From MaRDI portal
The following pages link to Choice Numbers of Graphs: a Probabilistic Approach (Q4291205):
Displayed 14 items.
- A note on list-coloring powers of graphs (Q400353) (← links)
- Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices (Q458608) (← links)
- Chromatic-choosability of the power of graphs (Q476310) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- The choice number of random bipartite graphs (Q1293418) (← links)
- Bipartite graphs whose squares are not chromatic-choosable (Q2260619) (← links)
- Partial Online List Coloring of Graphs (Q2862550) (← links)
- On a generalization of Rubin's theorem (Q3018075) (← links)
- On the probability of independent sets in random graphs (Q4798177) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- Choosability with Separation of Complete Multipartite Graphs and Hypergraphs (Q5418773) (← links)
- On the asymptotic value of the choice number of complete multi‐partite graphs (Q5471010) (← links)
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts (Q5711696) (← links)