Skip to main content
Springer Nature Link
Log in

A Contribution to a Conjecture of A. Saito

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 A. Saito conjectured that every finite 3-connected line graph of diameter at most 3 is hamiltonian unless it is the line graph of a graph obtained from the Petersen graph by adding at least one pendant edge to each of its vertices. Here we shall see that a line graph of connectivity 3 and diameter at most 3 has a hamiltonian path.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institut für Mathematik (A), Universität Hannover, Welfengarten 1, D-30167 Hannover, Germany e-mail: kriesell@math.uni-hannover.de, , , , , , DE

    Matthias Kriesell

Authors
  1. Matthias Kriesell
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: May 31, 2000 Final version received: August 17, 2001

RID="*"

ID="*" This work has partially been supported by DIMATIA, Grant 201/99/0242, Grant Agency of the Czech Republic

AMS subject classification: 05C45, 05C40

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kriesell, M. A Contribution to a Conjecture of A. Saito. Graphs Comb 18, 565–571 (2002). https://doi.org/10.1007/s003730200040

Download citation

  • Issue Date:

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