Decomposing a planar graph into a forest and a subgraph of restricted maximum degree

zbMath1132.05313MaRDI QIDQ2481185

Anna O. Ivanova, B. S. Stechkin, Oleg V. Borodin

Publication date: 14 April 2008

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/53811

zbMATH Keywords

matchinggame chromatic numbergame coloring numbermaximum degree of graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ Decomposing a graph into forests ⋮ Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree

This page was built for publication: Decomposing a planar graph into a forest and a subgraph of restricted maximum degree