Pages that link to "Item:Q266020"
From MaRDI portal
The following pages link to A note on the minimum number of choosability of planar graphs (Q266020):
Displaying 8 items.
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- (Q5081905) (← links)
