Login / Signup

The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle.

A. BenkouarYannis ManoussakisRachid Saad
Published in: Discret. Math. (2003)
Keyphrases
  • small number
  • computational complexity
  • undirected graph
  • case study
  • lower bound
  • maximum number
  • search algorithm
  • pattern mining
  • directed graph
  • graph matching
  • weighted graph
  • fixed number