2000 character limit reached
On normal odd partitions in cubic graphs
Published 28 Sep 2008 in cs.DM | (0809.4822v1)
Abstract: A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.
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.