Login / Signup

Every connected, locally connected nontrivial graph with no induced claw is hamiltonian.

David J. OberlySlobodan K. SimicDavid P. Sumner
Published in: J. Graph Theory (1979)
Keyphrases
  • connected components
  • neighborhood graph
  • random walk
  • directed graph
  • database
  • graph structure
  • real time
  • information retrieval
  • genetic algorithm
  • learning algorithm
  • image segmentation
  • graph model
  • graph construction