Decomposing a planar graph into degenerate graphs
From MaRDI portal
Publication:1907105
DOI10.1006/jctb.1995.1057zbMath0840.05070OpenAlexW1994519017MaRDI QIDQ1907105
Publication date: 27 June 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1057
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (21)
An extension of Thomassen's result on choosability ⋮ A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable ⋮ Colorings of oriented planar graphs avoiding a monochromatic subgraph ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ The high order spectrum of a graph and its applications in graph colouring and clique counting ⋮ On the vertex-arboricity of planar graphs ⋮ Decomposing a triangle-free planar graph into a forest and a subcubic forest ⋮ From the plane to higher surfaces ⋮ Partitioning a triangle-free planar graph into a forest and a forest of bounded degree ⋮ Partitioning a graph into degenerate subgraphs ⋮ Equitable partition of planar graphs ⋮ On a cycle partition problem ⋮ Cycle partition of two-connected and two-edge connected graphs ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs ⋮ Maximum bipartite subgraphs of cubic triangle-free planar graphs ⋮ Decomposing a planar graph of girth 5 into an independent set and a forest ⋮ Weak Unit Disk and Interval Representation of Graphs ⋮ Cover and variable degeneracy ⋮ Planar graphs without short even cycles are near-bipartite ⋮ Decomposing a planar graph into an independent set and a 3-degenerate graph
This page was built for publication: Decomposing a planar graph into degenerate graphs
