Pages that link to "Item:Q1356727"
From MaRDI portal
The following pages link to Choosability and fractional chromatic numbers (Q1356727):
Displaying 23 items.
- Free choosability of outerplanar graphs (Q293600) (← links)
- Multiple list colouring of planar graphs (Q345127) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- Complexity-penalized estimation of minimum volume sets for dependent data (Q990877) (← 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)
- Graph imperfection. I (Q1850556) (← links)
- Choosability and paintability of the lexicographic product of graphs (Q2030438) (← links)
- Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles (Q2084793) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- The strong fractional choice number of series-parallel graphs (Q2305910) (← links)
- Multiple list colouring triangle free planar graphs (Q2312604) (← links)
- Characterization of \((2m,m)\)-paintable graphs (Q2344816) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- Every planar graph is 1-defective \((9,2)\)-paintable (Q2656972) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- Fractional DP-chromatic number of planar graphs of large girth (Q5063294) (← links)
- On (4, 2)‐Choosable Graphs (Q5272926) (← links)
- The strong fractional choice number of 3‐choice‐critical graphs (Q6093154) (← links)
- Refined List Version of Hadwiger’s Conjecture (Q6171265) (← links)
- A note on fractional DP-coloring of graphs (Q6570045) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
