Pages that link to "Item:Q3977503"
From MaRDI portal
The following pages link to Choosability in graphs: Some results and open problems. A survey (Q3977503):
Displaying 8 items.
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- Towards a solution of the Dinitz problem? (Q1118600) (← links)
- Interval edge coloring of a graph with forbidden colors (Q1309462) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- Choosability in graphs (Q3922703) (← links)
- On the acyclic choosability of graphs (Q5469027) (← links)
- (Q5741893) (← links)