Login / Signup

More orthogonal double covers of complete graphs by Hamiltonian paths.

Sven HartmannUwe LeckVolker Leck
Published in: Discret. Math. (2008)
Keyphrases
  • bayesian networks
  • graph theory
  • graph theoretic
  • series parallel
  • search engine
  • social networks
  • case study
  • shortest path
  • graph matching
  • bipartite graph
  • graph model
  • optimal path
  • book covers
  • subgraph isomorphism