On normal partitions in cubic graphs
Jean‐Luc Fouquet, Jean-Marie Vanherpe · Discussiones Mathematicae Graph Theory · 2009
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.