Pages that link to "Item:Q4978291"
From MaRDI portal
The following pages link to Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291):
Displayed 13 items.
- WORM colorings of planar graphs (Q521753) (← links)
- Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
- Path choosability of planar graphs (Q1627209) (← links)
- Facial incidence colorings of embedded multigraphs (Q1630925) (← 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)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
- Colorings of plane graphs without long monochromatic facial paths (Q2656334) (← links)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- Islands in Graphs on Surfaces (Q5743553) (← links)
- (Q5878782) (← links)
- Path partition of planar graphs with girth at least six (Q6059078) (← links)