Classification of Hamiltonian Cycles of a 3-Connected Graph Which Contain Five Contractible Edges-Reference-Cited by-同舟云学术

Classification of Hamiltonian Cycles of a 3-Connected Graph Which Contain Five Contractible Edges

Published:2000-06-01 Issue:2 Volume:36 Page:
ISSN:0916-5746
Container-title:SUT Journal of Mathematics
language:
Short-container-title:SUT J. Math.

Author:

Fujita Kyo¹,Kotani Keiko²

Affiliation:

1. Department of Applied Mathematics, Science University of Tokyo, 1-3 Kagurazaka, Shinjuku-ku, Tokyo, 162-8601 Japan

2. Department of Mathematics, Science University of Tokyo, 26 Wakamiya-cho, Shinjuku-ku, Tokyo, 162-0827 Japan

Publisher

SUT Journal of Mathematics - Tokyo University of Science

Subject

General Mathematics

Reference6 articles.

1. [1] R. E. L. Aldred, R. L. Hemminger and K. Ota, The 3-connected graphs having a longest cycle containing only three contractible edges, J. Graph Theory, 17 (1993), 361–371.

2. [2] N. Dean, R. L. Hemminger and K. Ota, Longest cycles in 3-connected graphs contain three contractible edges, J. Graph Theory, 12 (1989), 17–21.

3. [3] M. N. Ellingham, R. L. Hemminger and K. E. Johnson, Contractible edges in longest cycles in non-hamiltonian graphs, Discrete Math, 133 (1994), 89–98.

4. [4] K. Fujita, Longest cycles $C$ in a 3-connected graph $G$ such that $C$ contains precisely four contractible edges of $G$ , Math. Japonica, 43 (1996), 99–116.

5. [5] K. Ota, Non-critical subgraphs in $k$ -connected graphs, Ph. D. Dissertation, University of Tokyo (1989).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Contractible edges in longest cycles;Journal of Graph Theory;2023-02-19

2. Contractible Edges and Longest Cycles in 3-Connected Graphs;Graphs and Combinatorics;2023-01-17

3. Longest Cycles of a 3-Connected Graph Which Contain Four Contractible Edges;SUT Journal of Mathematics;2007-06-01