---
tag: TS7TH5APV1
kind: concept
name: Hamiltonian decomposition
sources:
  - wikipedia: en:24004195@r1360691131
    locator: Hamiltonian decomposition
    note: adopted
    mention: wikipedia://en/24004195
    sections: [Summary]
same_as:
  wikidata: Q48995716
  wikipedia: Hamiltonian decomposition
inventory: [CZYAEDWX8K]
---

## Summary

In graph theory, a branch of mathematics, a **Hamiltonian decomposition** of a given graph is a [[partition|08QMKTWF9T]] of the edges of the graph into Hamiltonian cycles. Hamiltonian decompositions have been studied both for undirected graphs and for [[directed graphs|0KFYGSHHF5]]. In the undirected case a Hamiltonian decomposition can also be described as a 2-factorization of the graph such that each factor is connected.