The following pages link to (Q4797463):
Displaying 26 items.
- From the plane to higher surfaces (Q444375) (← links)
- Maximum 4-degenerate subgraph of a planar graph (Q490312) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without short even cycles are near-bipartite (Q777449) (← links)
- The chromatic number of a signed graph (Q907266) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← links)
- On the vertex partition of planar graphs into forests with bounded degree (Q2294901) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- (Circular) backbone colouring: forest backbones in planar graphs (Q2449063) (← links)
- Large induced forests in triangle-free planar graphs (Q2494123) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- (Q5878782) (← links)
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
- Make a graph singly connected by edge orientations (Q6182906) (← links)
- Decomposing a triangle-free planar graph into a forest and a subcubic forest (Q6189685) (← links)