Pages that link to "Item:Q1025484"
From MaRDI portal
The following pages link to Some results on \((a:b)\)-choosability (Q1025484):
Displaying 13 items.
- Free choosability of outerplanar graphs (Q293600) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- The complexity of planar graph choosability (Q1126188) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- The trouble with the second quantifier (Q2044549) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Choosability of P 5-Free Graphs (Q3182940) (← links)
- Edge (m,k)-choosability of graphs (Q5057728) (← links)
