Eulerian graphs and local complementation

Details Eulerian graphs and local complementation Eulerian graphs and local complementation

2007-01-15

arxiv.org/abs/math/0701421v1

Mathematics

Combinatorics

103 pages, Ph.D. thesis published in 2002, French introduction and conclusion

Scientific paper

We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover Conjecture. We show how substitution rules can be used to determine when two complementation words produce the same graph. For bicoloured graphs, complementation words give way to complementation sets. The invertible graphs (bicoloured graphs whose vertex set is a complementation set) are shown to have the property that their inverse has the same automorphisms. The property of being invertible can also be defined for non-coloured graphs by endowing them with their natural colouring. It is proposed that a characterization of pure graphs would contribute to establish the truth of the Cycle Double Cover Conjecture. We show how pure graphs have essential factorizations into primitive pure graphs. The four primitive pure parity classes are presented.

Affiliated with

Also associated with

No associations

Rating

Eulerian graphs and local complementation 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 Eulerian graphs and local complementation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eulerian graphs and local complementation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-585399