scientific article; zbMATH DE number 1882351
From MaRDI portal
Publication:4797463
Recommendations
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- scientific article; zbMATH DE number 6125173
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- Acyclic edge coloring of planar graphs with girth at least 5
- Decomposing a planar graph of girth 5 into an independent set and a forest
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Path partition of planar graphs with girth at least six
- Partitioning planar graphs with girth at least 6 into bounded size components
- On uniquely partitionable planar graphs
- A sufficient condition for planar graphs to be acyclically 5-choosable
Cited in
(33)- Partition of a planar graph with girth 6 into two forests with chain length at most 4
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
- On the vertex-arboricity of planar graphs
- On the vertex partition of planar graphs into forests with bounded degree
- Note on partitions of planar graphs
- Make a graph singly connected by edge orientations
- Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
- Planar graphs without short even cycles are near-bipartite
- Large induced forests in triangle-free planar graphs
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- Partitioning planar graph of girth 5 into two forests with maximum degree 4.
- Partitioning planar graphs into bounded degree forests
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
- Decomposing a planar graph of girth 5 into an independent set and a forest
- From the plane to higher surfaces
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
- An (F1,F4)‐partition of graphs with low genus and girth at least 6
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
- Vertex partitions into an independent set and a forest with each component small
- Splitting a planar graph of girth 5 into two forests with trees of small diameter
- Sparse graphs are near-bipartite
- Partition of a planar graph with girth 7 into two star forests
- scientific article; zbMATH DE number 6125173 (Why is no real title available?)
- A step towards the strong version of Havel's three color conjecture
- The chromatic number of a signed graph
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- Maximum 4-degenerate subgraph of a planar graph
- Partitioning planar graphs with girth at least 6 into bounded size components
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable
- (Circular) backbone colouring: forest backbones in planar graphs
- Decomposing a triangle-free planar graph into a forest and a subcubic forest
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797463)
