On the pancyclicity of lexicographic products

DOI10.1007/S00373-005-0639-7MaRDI QIDQ2494117zbMATH OpenOpenAlexFDO

Authors Tomáš Kaiser, Matthias Kriesell

Publication date 16 June 2006

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-005-0639-7

zbMATH Keywords

circumferencecycleHamiltoniantoughness

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 3920510
• Vertex pancyclicity over lexicographic products
• scientific article; zbMATH DE number 1089088
• Minimum cycle bases of lexicographic products
• Pancyclicity of strong products of graphs

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 68918 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• scientific article; zbMATH DE number 1089088 (Why is no real title available?)
• Toughness, trees, and walks

Cited in

(11)

• Representable lexicographic products
• Pancyclicity of strong products of graphs
• The weight of lexicographic products
• Recent advances on the Hamiltonian problem: survey III
• Sequential properties of lexicographic products
• scientific article; zbMATH DE number 3920510 (Why is no real title available?)
• Lexicographic products with high reconstruction numbers
• scientific article; zbMATH DE number 1089088 (Why is no real title available?)
• Vertex pancyclicity over lexicographic products
• Hamiltonian properties in generalized lexicographic products
• Contractions, cycle double covers, and cyclic colorings in locally connected graphs

This page was built for publication: On the pancyclicity of lexicographic products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494117)