Skip to main content
Springer Nature Link
Log in

Maximum Number of Contractible Edges on Hamiltonian Cycles of a 3-Connected Graph

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 We show that if G is a 3-connected hamiltonian graph of order at least 5, then there exists a hamiltonian cycle C of G such that the number of contractible edges of G which are on C is greater than or equal to .

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+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

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

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Science University of Tokyo, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601, Japan. e-mail: kyo@ha.bekkoame.ne.jp, , , , , , JP

    Kyo Fujita

Authors
  1. Kyo Fujita
    View author publications

    Search author on:PubMed Google Scholar

Additional information

Received: July 31, 2000 Final version received: December 12, 2000

Acknowledgments. I would like to thank Professor Yoshimi Egawa for the help he gave to me during the preparation of this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fujita, K. Maximum Number of Contractible Edges on Hamiltonian Cycles of a 3-Connected Graph. Graphs Comb 18, 447–478 (2002). https://doi.org/10.1007/s003730200033

Download citation

  • Issue Date:

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

Keywords