David Tankus, Michael Tarsi Greedily constructing Hamiltonian paths, Hamiltonian cycles and maximum linear forests. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:15, pp:1833-1843 [Journal]

Xiebin Chen The number of spanning trees in directed circulant graphs with non-fixed jumps. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:15, pp:1873-1880 [Journal]

Max I. Kanovich The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:15, pp:1909-1935 [Journal]

Mihai Ciucu A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd order. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:15, pp:1957-1960 [Journal]