The following pages link to Coloring of double disk graphs (Q1424964):
Displaying 7 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)