Decomposing a planar graph into an independent set and a 3-degenerate graph

DOI10.1006/jctb.2001.2056zbMath1024.05075DBLPjournals/jct/Thomassen01OpenAlexW2113016610WikidataQ56926736 ScholiaQ56926736MaRDI QIDQ1850567

Carsten Thomassen

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2056

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (14)

An extension of Thomassen's result on choosability ⋮ A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable ⋮ Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ 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 ⋮ An update on reconfiguring 10-colorings of planar graphs ⋮ Partitioning a graph into degenerate subgraphs ⋮ A Thomassen-type method for planar graph recoloring ⋮ Decomposing a planar graph of girth 5 into an independent set and a forest ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Cover and variable degeneracy ⋮ Planar graphs without short even cycles are near-bipartite

Cites Work

• Every planar graph is 5-choosable
• Color-critical graphs on a fixed surface
• Decomposing a planar graph into degenerate graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing a planar graph into an independent set and a 3-degenerate graph