Enforced Hamiltonian Cycles in Generalized Dodecahedra
2013
Maria Timkova

Metrics

  • Eye Icon 170 views
  • Download Icon 42 downloads
Metrics Icon 170 views  //  42 downloads
Abstract

The H-force number of a hamiltonian graph G is the smallest number k with the property that there exists a set W ⊆ V (G) with |W| = k such that each cycle passing through all vertices of W is a hamiltonian cycle. In this paper, we determine the H-force numbers of generalized dodecahedra.

Full text
Show more arrow
 
More from this journal
Efficient Maximum Matching Algorithms for Trapezoid Graphs
Some Diameter Notions in Lexicographic Product
🧐  Browse all from this journal

Metrics

  • Eye Icon 170 views
  • Download Icon 42 downloads
Metrics Icon 170 views  //  42 downloads