Pages that link to "Item:Q1026008"
From MaRDI portal
The following pages link to Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008):
Displaying 14 items.
- From the plane to higher surfaces (Q444375) (← links)
- Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- Decomposing a planar graph into an independent set and a 3-degenerate graph (Q1850567) (← links)
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- Planar graphs without normally adjacent short cycles (Q2144582) (← links)
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- (Circular) backbone colouring: forest backbones in planar graphs (Q2449063) (← links)
- (Q4797463) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Decomposing a triangle-free planar graph into a forest and a subcubic forest (Q6189685) (← links)
