Skip to main content
SpringerLink
Log in
Book cover

Theory and Applications of Graphs pp 491–499Cite as

Hamiltonian persistency is periodic among iterated line digraphs

  • Conference paper
  • First Online:

  • 1518 Accesses

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 642))

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Behzad and G. Chartrand, Introduction to the Theory of Graphs (Allyn and Bacon, Boston, 1971).

    MATH  Google Scholar 

  2. G. Chartrand, The existence of complete cycles in repeated line-graphs, Bulletin of the American Mathematical Society LXXI, 668–670 (1965).

    Article  MathSciNet  Google Scholar 

  3. F. Harary, Graph Theory (Addison-Wesley, Reading, Mass., 1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Louisville, Louisville, Kentucky, 40208, USA

    John Roberts

Authors
  1. John Roberts
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Western Michigan University, Kalamazoo, MI, 49008, USA

    Yousef Alavi  & Don R. Lick  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roberts, J. (1978). Hamiltonian persistency is periodic among iterated line digraphs. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070405

Download citation

  • DOI: https://doi.org/10.1007/BFb0070405

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation