Greg Cohen. A new algebraic technique for polynomial-time computing the number modulo 2 of Hamiltonian decompositions and similar partitions of a graph's edge set

Natural Sciences / Mathematics / Graph theory

Submitted on: Jul 03, 2012, 21:37:45

Description: In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph's edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the number modulo 2 of, say, Hamiltonian cycles/paths etc. While the problems of finding a Hamiltonian decomposition and Hamiltonian cycle are NP-complete, counting these objects modulo 2 in polynomial time is yet possible for certain types of regular undirected graphs. Some of the most known examples are the theorems about the existence of an even number of Hamiltonian decompositions in a 4-regular graph and an even number of such decompositions where two given edges e and g belong to different cycles (Thomason, 1978), as well as an even number of Hamiltonian cycles passing through any given edge in a regular odd-degreed graph (Smith's theorem).

The abstract of this article has been published in the "Intellectual Archive Bulletin" , July 2012, ISSN 1929-1329.

The Library and Archives Canada reference page:

To read the article posted on Intellectual Archive web site please click the link below.


© 2011-2017 Shiny World Corp. All rights reserved. To reach us please send an e-mail to