Publication:4797463
From MaRDI portal
zbMath1012.05133MaRDI QIDQ4797463
Alekseĭ Nikolaevich Glebov, Oleg V. Borodin
Publication date: 16 March 2003
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Sparse Graphs Are Near-Bipartite, Unnamed Item, Partitioning a triangle-free planar graph into a forest and a forest of bounded degree, Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration, An (F1,F4)‐partition of graphs with low genus and girth at least 6, A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles, From the plane to higher surfaces, Maximum 4-degenerate subgraph of a planar graph, Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable, Planar graphs without short even cycles are near-bipartite, The chromatic number of a signed graph, 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, A step towards the strong version of Havel's three color conjecture, An \((F_3,F_5)\)-partition of planar graphs with girth at least 5, Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest, Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph, A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable, Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests, On the vertex partition of planar graphs into forests with bounded degree, On the vertex-arboricity of planar graphs, (Circular) backbone colouring: forest backbones in planar graphs, Large induced forests in triangle-free planar graphs
