7 search results - page 2 / 2 » Forbidden subgraphs and the existence of a 2-factor |
DM
2008
13 years 5 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
BIBM
2008
IEEE
13 years 11 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...