Skip to content
  • Home
  • Book Bag: 0 items (Full)
    • English
    • 日本語
    • 中文(简体)
    • 中文(繁體)
    • اللغة العربية
  • About
Advanced
  • On Hamiltonian Paths and Cycle...
  • Cite this
  • Text this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Add to Book Bag Remove from Book Bag
  • Permanent link

On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs

Graph Theory

Bibliographic Details
Published in:Discrete Mathematics & Theoretical Computer Science
Main Authors: Christian Löwenstein, Dieter Rautenbach, Roman Soták
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2014-02-01
Subjects:
distance graph
circulant graph
hamiltonian path
hamiltonian cycle
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/1261/pdf
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

https://dmtcs.episciences.org/1261/pdf

Similar Items

  • On hamiltonian chain saturated uniform hypergraphs
    by: Aneta Dudek, et al.
    Published: (2012-01-01)
  • On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance
    by: Shih-Yan Chen, et al.
    Published: (2016-08-01)
  • Hamiltonian decomposition of prisms over cubic graphs
    by: Moshe Rosenfeld, et al.
    Published: (2015-05-01)
  • Traceability of locally hamiltonian and locally traceable graphs
    by: Johan De Wet, et al.
    Published: (2016-07-01)
  • Graphs with many vertex-disjoint cycles
    by: Dieter Rautenbach, et al.
    Published: (2012-09-01)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs