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

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2010★ 1 cited

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

Greg Cohen

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…