|
|||||
|
|
Pancyclicity of Strong Products of Graphs |
|
| Authors: | |
| Institution: | (1) Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00 Prague, Czech Republic;(2) Institute for Theoretical Computer Science, Charles University, Malostranské nám. 25, 118 00 Prague, Czech Republic;(3) Department of Mathematical Analysis, Charles University, Sokolovská 83, 186 75 Prague Czech, Republic;(4) Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00 Prague, Czech Republic |
| Abstract: | We prove that the strong product of graphs G1× ×Gn is pancyclic, in particular hamiltonian, for n c for any cln(25/12)+1/640.75 whenever all Gi are connected graphs with the maximum degree at most .This research was supported by KONTAKT ME 337 as a part of REU programme and in part by GACR 201/99/0242The author acknowledges partial support by NSF grant DMS-9900969 and by Institute for Theoretical Computer ScienceThe author acknowledges partial support by Institute for Theoretical Computer ScienceInstitute for Theoretical Computer Science is supported by Ministry of Education of Czech Republic as project LN00A056Final version received: August 6, 2003 |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |