On normal odd partitions in cubic graphs
Discrete Mathematics
2009-11-06 v1
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.
Keywords
Cite
@article{arxiv.0809.4822,
title = {On normal odd partitions in cubic graphs},
author = {Jean-Luc Fouquet and Jean-Marie Vanherpe},
journal= {arXiv preprint arXiv:0809.4822},
year = {2009}
}