The following pages link to (Q4888118):
Displaying 26 items.
- Free choosability of outerplanar graphs (Q293600) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Choosability and fractional chromatic numbers (Q1356727) (← links)
- List colorings and reducibility (Q1372746) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable (Q2225433) (← links)
- Characterization of \((2m,m)\)-paintable graphs (Q2344816) (← links)
- Strengthening \((a,b)\)-choosability results to \((a,b)\)-paintability (Q2411512) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- Oriented list colorings of graphs (Q2725322) (← links)
- The \(L (2,1)\)-choosability of cycle (Q2836961) (← links)
- Graph choosability and double list colorability (Q3013259) (← links)
- A characterization of (4,2)‐choosable graphs (Q3299217) (← links)
- Choosability in graphs (Q3922703) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- Edge (m,k)-choosability of graphs (Q5057728) (← links)
- Fractional DP-chromatic number of planar graphs of large girth (Q5063294) (← links)
- On (4, 2)‐Choosable Graphs (Q5272926) (← links)
- Coloring graphs from lists with bounded size of their union (Q5462386) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
- The strong fractional choice number of 3‐choice‐critical graphs (Q6093154) (← links)
- Multiple list coloring of 3‐choice critical graphs (Q6134649) (← links)
- A note on fractional DP-coloring of graphs (Q6570045) (← links)
