Pancyclicity of Strong Products of Graphs
2004
We prove that the strong product of graphs G1×⋯×Gn is pancyclic, in particular hamiltonian, for n≈cΔ for any cln(25/12)+1/64≈0.75 whenever all Gi are connected graphs with the maximum degree at most Δ.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
4
References
3
Citations
NaN
KQI