Login / Signup

A chvátal-erdős type condition for hamiltonian graphs.

Xiaoyun Lu
Published in: J. Graph Theory (1994)
Keyphrases
  • strictly convex
  • graph theoretic
  • sufficient conditions
  • database
  • data sets
  • search engine
  • directed graph
  • graph matching
  • graph databases
  • graph partitioning
  • subgraph isomorphism
  • series parallel