Pages that link to "Item:Q1916140"
From MaRDI portal
The following pages link to Decomposition of some planar graphs into trees (Q1916140):
Displaying 14 items.
- 4-labelings and grid embeddings of plane quadrangulations (Q418877) (← links)
- Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
- Generation of trees of a graph with the use of decomposition (Q800368) (← links)
- Tree-decompositions of graphs. I (Q1370176) (← links)
- A note on the tree decompositions of graphs (Q1387426) (← links)
- Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
- Thin trees in 8-edge-connected planar graphs (Q1711432) (← links)
- A structural property of trees with an application to vertex-arboricity (Q1992728) (← links)
- Decomposition of complete graphs into arbitrary trees (Q2042202) (← links)
- Decomposition into two trees with orientation constraints (Q2339817) (← links)
- Planar branch decompositions. I: The ratcatcher (Q2892257) (← links)
- Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs (Q3188882) (← links)
- Graph Drawing (Q5711639) (← links)
- Decomposing planar graphs into graphs with degree restrictions (Q6081583) (← links)