Daniel Kral, Ladislav Stacho  Home/Search
Context
Related
| kam.mff.cuni.cz/~kamserie/...s689.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: kam.mff.cuni.cz/~kamseri...kamser (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We prove that the strong product of any at least (ln 2)+O( ) non-trivial connected graphs of maximum degree at most is pancyclic. (Update)
Similar documents based on text: More All
0.3: Closure for the Property of Having a Hamiltonian Prism - Kral, Stacho (2003) (Correct)
0.2: On Hamiltonian Cycles in Strong Products of Graphs - Kral, Maxova, Podbrdsky, Samal (2001) (Correct)
0.2: Unknown - (2001) (Correct)
BibTeX entry: (Update)
@misc{ kral-hamiltonian,
author = "Daniel Kral and Ladislav Stacho",
title = "Hamiltonian Threshold for Strong Products of Graphs",
url = "citeseer.ist.psu.edu/kral04hamiltonian.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
26 A survey of combinatorial Gray codes - Savage - 1997
26 Basic graph theory: paths and circuits (context) - Bondy - 1995
12 Wiley Interscience Series in Discrete Mathematics and Optimi.. (context) - Cook, Cunningham et al. - 1998
5 Advances on the Hamiltonian problem | a survey (context) - Gould - 2003
5 Hamiltonian cycles (context) - Chv - 1985
5 Graduate texts in Mathematics Vol (context) - Diestel, Theory - 2000
2 On factors with given components (context) - Amahashi, Kano - 1982
2 Hamiltonian Circuits in Certain Prisms (context) - Barnette, Rosenfeld - 1973
2 Hamiltonian Cycles in Strong Products of Graphs (context) - Bermond, Germa et al. - 1979
2 Series: Algorithms and Combinatorics (context) - Schrijver, polyhedra - 2003
1 Pancyclicity of strong products of graphs (context) - Kr, Maxov et al. - 2004
1 Hamiltonian cycles in products of graphs (context) - Zaks - 1975
1 Updating the Hamiltonian problem (context) - Gould - 1991
1 Hamilton cycles in strong products of graphs (context) - Kr, Maxov et al.
[Article contains additional citations not shown here]
Documents on the same site (http://kam.mff.cuni.cz/~kamserie/kamser.html): More
On-Line and Off-Line Distance Constrained Labeling of Disk.. - Fiala, Fishkin, Fomin (2002) (Correct)
On Pattern Coloring of Cycle Systems - Dvorak, Kara, Kral, Pangrac (2002) (Correct)
A Constructive View of Complete Regularity - Banaschewski, Pultr (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC