5 search results - page 1 / 1 » Independent dominating sets and hamiltonian cycles |
JGT
2007
13 years 4 months ago
2007
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r-regular uniquely hamiltonian graphs when r > 22. This im...
SIAMCOMP
2010
12 years 11 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
JCT
2010
13 years 3 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
LCTRTS
2007
Springer
13 years 11 months ago
2007
Springer
Energy efficiency is an important factor in embedded systems design. We consider an embedded system with a dynamic voltage scaling (DVS) capable processor and its system-wide pow...