Pages that link to "Item:Q405685"
From MaRDI portal
The following pages link to Minimum number of disjoint linear forests covering a planar graph (Q405685):
Displaying 5 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 total coloring of planar graph (Q475814) (← links)
- The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)