Login / Signup

Characterization of edge-colored complete graphs with properly colored Hamilton paths.

Jinfeng FengHans-Erik GiesenYubao GuoGregory Z. GutinTommy R. JensenArash Rafiey
Published in: J. Graph Theory (2006)
Keyphrases
  • weighted graph
  • disjoint paths
  • edge detection
  • minimum spanning trees
  • undirected graph
  • website
  • np hard
  • graph matching
  • data mining