Pancyclicity of Strong Products of Graphs

Pancyclicity of Strong Products of Graphs

We prove that the strong product of graphs G1x. . .xGn is pancyclic, in particular hamiltonian, for n approximately cDelta for any cln(25/12)+1/64 approximately 0.75 whenever all Gi are connected graphs with the maximum degree at most Delta. [PUBLICATION ABSTRACT]

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2004-03, Vol.20 (1), p.91-104
Hauptverfasser: Král, Daniel, Maxová, Jana, Podbrdský, Pavel, Šámal, Robert
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorics
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that the strong product of graphs G1x. . .xGn is pancyclic, in particular hamiltonian, for n approximately cDelta for any cln(25/12)+1/64 approximately 0.75 whenever all Gi are connected graphs with the maximum degree at most Delta. [PUBLICATION ABSTRACT]
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-003-0545-9