On pancyclism in hamiltonian graphs

Authors:
Mekkia Kouider;Antoni Marczyk
Affiliations:
L.R.I, Université de Paris-Sud, Bât. 490, 91405 Orsay, France;Faculty of Applied Mathematics, AGH, Al. Mickiewicza 30, 30-059 Kraków, Poland
Venue:
Discrete Mathematics
Year:
2002

Citing 4
Cited 4

Pancyclism and bipancyclism of Hamiltonian graphs

Journal of Combinatorial Theory Series B
Small cycles in Hamiltonian graphs

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Another cycle structure theorem for hamiltonian graphs

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

Cycles in Hamiltonian graphs of prescribed maximum degree

Discrete Mathematics - Special issue: The 18th British combinatorial conference
The Grid-Pyramid: A Generalized Pyramid Network

The Journal of Supercomputing
Some topological and combinatorial properties of WK-recursive mesh and WK-pyramid interconnection networks

Journal of Systems Architecture: the EUROMICRO Journal
On embedding cycles into faulty twisted cubes

Information Sciences: an International Journal

Quantified Score

Hi-index	0.05

Visualization

Abstract

We investigate the set of cycle lengths occurring in a hamiltonian graph with at least one or two vertices of large degree. We prove that in every case this set contains all the integers between 3 and some t, where t depends on the order of the graph and the degrees of vertices.