Pages that link to "Item:Q1752682"
From MaRDI portal
The following pages link to Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682):
Displaying 6 items.
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
- (Q4797463) (← links)
- Recoloring Planar Graphs of Girth at Least Five (Q5883290) (← links)