Pages that link to "Item:Q2848800"
From MaRDI portal
The following pages link to The linear arboricity of planar graphs with maximum degree at least 7 (Q2848800):
Displaying 11 items.
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- The linear arboricity of planar graphs with maximum degree at least 5 (Q456114) (← links)
- The linear arboricity of planar graphs with maximum degree at least five (Q648443) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- The linear arboricity of \(K_5\)-minor free graphs (Q2081465) (← links)
- A note on 1-planar graphs with minimum degree 7 (Q2217475) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- A result on linear arboricity of planar graphs. (Q2804855) (← links)
- The linear arboricity of planar graphs of maximum degree seven is four (Q3522847) (← links)
- On the linear arboricity of planar graphs (Q4248536) (← links)
- Linear arboricity of planar graphs with maximum degree at least seven (Q4986052) (← links)