On Compatible Normal Odd Partitions in Cubic Graphs

DOI10.1002/jgt.21652zbMath1261.05083arXiv1201.5729OpenAlexW2161008715MaRDI QIDQ4916102

Jean-Luc Fouquet, Jean-Marie Vanherpe

Publication date: 19 April 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.5729

zbMATH Keywords

cubic graphPetersen graphtrailsedge-partitionnormal odd partitions

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Decomposition of cubic graphs with a 2-factor consisting of three cycles ⋮ Decomposing plane cubic graphs

Cites Work

• Fulkerson's conjecture and circuit covers
• On normal partitions in cubic graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: On Compatible Normal Odd Partitions in Cubic Graphs