193
click to vote
COMBINATORICA
2010
15 years 12 days ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...