Graph factorization: Difference between revisions

Content deleted Content added
Notes: standard section title
Line 87:
The [[Oberwolfach problem]] concerns the existence of 2-factorizations of [[complete graph]]s into isomorphic subgraphs. It asks for which subgraphs this is possible. This is known when the subgraph is connected (in which case it is a [[Hamiltonian cycle]] and this special case is the problem of [[Hamiltonian decomposition]]) but the general case remains unsolved.
 
==NotesReferences==
{{reflist}}