Prefer a chat interface with context about you and your work?
Edge‐partitions of planar graphs and their game coloring numbers
Abstract Let G be a planar graph and let g ( G ) and Δ( G ) be its girth and maximum degree, respectively. We show that G has an edge‐partition into a forest and a subgraph H so that (i) Δ( H ) ≤ 4 if g ( G …