On the Cycle Spectrum of Cubic Hamiltonian Graphs

We prove lower bounds on the number of different cycle lengths of cubic Hamiltonian graphs that do not contain a fixed subdivision of a claw as an induced subgraph.

Saved in:
Bibliographic Details
Published inGraphs and combinatorics Vol. 29; no. 4; pp. 1067 - 1076
Main Authors Müttel, Janina, Rautenbach, Dieter, Regen, Friedrich, Sasse, Thomas
Format Journal Article
LanguageEnglish
Published Japan Springer Japan 01.07.2013
Springer Nature B.V
Subjects
Claws
Combinatorial analysis
Combinatorics
Engineering Design
Graph theory
Graphs
Lower bounds
Mathematics
Mathematics and Statistics
Operations research
Original Paper
Subdivisions
Germany
05C45
Hamiltonian cycle
Claw-free
Pancyclic graphs
Cycle length
Cycle spectrum
05C38
Online AccessGet full text

Cover

More Information
Summary:We prove lower bounds on the number of different cycle lengths of cubic Hamiltonian graphs that do not contain a fixed subdivision of a claw as an induced subgraph.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-012-1156-0