On Compatible Normal Odd Partitions in Cubic Graphs - Archive ouverte HAL Access content directly
Journal Articles Journal of Graph Theory Year : 2013

On Compatible Normal Odd Partitions in Cubic Graphs


A normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v, we can distinguish the edge for which this vertex is pending. Three normal odd partitions are compatible whenever these distinguished edges are distinct for each vertex. We examine this notion and show that a cubic 3 edge-colorable graph can always be provided with three compatible normal odd partitions. The Petersen graph has this property and we can construct other cubic graphs with chromatic index four with the same property. Finally, we propose a new conjecture which, if true, would imply the well known Fan and Raspaud Conjecture
Fichier principal
Vignette du fichier
PNIC_V4_HAL.pdf (317.14 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00144319 , version 1 (02-05-2007)
hal-00144319 , version 2 (27-01-2012)



Jean-Luc Fouquet, Jean-Marie Vanherpe. On Compatible Normal Odd Partitions in Cubic Graphs. Journal of Graph Theory, 2013, 72 (4), pp.410-461. ⟨10.1002/jgt21652⟩. ⟨hal-00144319v2⟩
88 View
149 Download



Gmail Mastodon Facebook X LinkedIn More