The following pages link to (Q4500691):
Displayed 40 items.
- Online containers for hypergraphs, with applications to linear equations (Q326815) (← links)
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Shelah's revised GCH theorem and a question by Alon on infinite graphs colorings (Q466092) (← links)
- Hypergraph containers (Q496210) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs (Q668046) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- A note on the DP-chromatic number of complete bipartite graphs (Q1783631) (← links)
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Answers to two questions on the DP color function (Q2030743) (← links)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- On the chromatic polynomial and counting DP-colorings of graphs (Q2221788) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- The asymptotic behavior of the correspondence chromatic number (Q2629278) (← links)
- Some new bounds on \(T_{r}\)-choosability (Q2643324) (← links)
- Proportional choosability of complete bipartite graphs (Q2657094) (← links)
- List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs (Q2811205) (← links)
- Lower bounds on coloring numbers from hardness hypotheses in pcf theory (Q2827384) (← links)
- List Colourings of Regular Hypergraphs (Q2883869) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- Circular choosability (Q3652533) (← links)
- List colorings of multipartite hypergraphs (Q5216184) (← links)
- Separation Choosability and Dense Bipartite Induced Subgraphs (Q5222550) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- The interactive sum choice number of graphs (Q5915807) (← links)
- The interactive sum choice number of graphs (Q5919074) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)