Pages that link to "Item:Q5264731"
From MaRDI portal
The following pages link to Partition of a planar graph with girth 6 into two forests with chain length at most 4 (Q5264731):
Displayed 4 items.
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
