Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens

DOI10.1016/0012-365X(82)90163-7zbMath0475.05057WikidataQ126458137 ScholiaQ126458137MaRDI QIDQ1159694

Jacques Aubert, Bernadette Schneider

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

n-cubehamiltonian cyclescartesian sum

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

Hamiltonian decompositions of Cayley graphs on Abelian groups ⋮ Methods and problems of communication in usual networks ⋮ Hamiltonian decomposition of Cayley graphs of degree 4 ⋮ Hamiltonicity of the cross product of two Hamiltonian graphs ⋮ Hamilton circuits in the directed wrapped Butterfly network ⋮ On the identification problems in products of cycles ⋮ Paley graphs have Hamilton decompositions ⋮ Symmetric edge-decompositions of hypercubes ⋮ Hamilton decompositions of Cartesian products of graphs ⋮ Tight bounds for oblivious routing in the hypercube ⋮ Hamilton decompositions of directed cubes and products ⋮ Long path and cycle decompositions of even hypercubes ⋮ Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups ⋮ Cycle factorizations of cycle products ⋮ Edge decompositions of hypercubes by paths and by cycles

Cites Work

• Unnamed Item
• Décomposition de \(K_ m\) + \(K_ n\) en cycles hamiltoniens
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Hamiltonian factorization of the product of a complete graph with itself
• Hamiltonian decompositions of products of cycles

This page was built for publication: Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens