Edge condition for Hamiltonicity in balanced tripartite graphs

DOI10.7494/OPMATH.2009.29.4.337MaRDI QIDQ3561531zbMATH OpenFDO

Authors Janusz Adamus

Publication date 25 May 2010

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7494/OPMATH.2009.29.4.337

zbMATH Keywords

edge conditionHamilton cyclepancyclicitytripartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Finding long cycles in balanced tripartite graphs: a first step
• A degree sum condition on Hamiltonian cycles in balanced 3-partite graphs
• A sufficient condition for Hamiltonians in balanced bipartite graphs
• Edge condition for a Hamiltonian bipartite graph to be bipancyclic
• On Hamiltonian cycles in balanced \(k\)-partite graphs

Cited in

(4)

• A degree sum condition on Hamiltonian cycles in balanced 3-partite graphs
• Edge condition for a Hamiltonian bipartite graph to be bipancyclic
• Chorded pancyclicity in \(k\)-partite graphs
• Finding long cycles in balanced tripartite graphs: a first step

This page was built for publication: Edge condition for Hamiltonicity in balanced tripartite graphs

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