On normal odd partitions in cubic graphs

Details On normal odd partitions in cubic graphs On normal odd partitions in cubic graphs

2008-09-28

arxiv.org/abs/0809.4822v1

Discussiones Mathematicae Graph Theory 29, 2 (2009) 293-312

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On normal odd partitions in cubic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On normal odd partitions in cubic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On normal odd partitions in cubic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353592