Keywords

#hamiltonian_decomposition

Hamiltonian decomposition

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

Mon 19th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Hamiltonian decomposition Hamiltonian path Graph amalgamation Hamiltonian matrix Hamiltonian simulation Folkman graph ADM formalism Herschel graph Helmholtz decomposition Graph factorization
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.