Pages that link to "Item:Q2119462"
From MaRDI portal
The following pages link to Acyclic choosability of graphs with bounded degree (Q2119462):
Displaying 6 items.
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- The minimum degree of recursively representable choice functions (Q1072546) (← links)
- Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
- (\(1,\lambda\))-embedded graphs and the acyclic edge choosability (Q2890349) (← links)
- On the acyclic choosability of graphs (Q5469027) (← links)