2000 character limit reached
On Simultaneous 2-locally-balanced 2-partition for Two Forests with Same Vertices
Published 2 May 2014 in math.CO and cs.DM | (1405.0326v1)
Abstract: The existence of a partition of the common set of the vertices of two forests into two subsets, when difference of their capacities in the neighborhood of each vertex of each forest not greater than 2 is proved, and an example, which shows that improvement of the specified constant is impossible is brought.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.