Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Benkouar, A."

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle
    (Discrete Mathematics, 2003) Benkouar, A.; Manoussakis, Y.; Saad, R.
    Let G be a 2-edge-colored complete graph of even order n. A cycle of G is alternating if any two successive edges differ in color. We prove that there is a one-to-one correspondence between the set of bipartite tournaments of order n admitting a unique hamiltonian cycle and the set of 2-edge-colored complete graphs of order n admitting a unique alternating hamiltonian cycle. © 2002 Elsevier Science B.V. All rights reserved

DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify