Finding long cycles in balanced tripartite graphs: a first step

DOI10.1007/978-3-030-77983-2_1zbMath1482.05079OpenAlexW3202849795MaRDI QIDQ2073190

Zhanar Berikkyzy, Kirsten Hogenson, Rachel Kirsch, Jessica McDonald, Gabriela Araujo-Pardo, Jill R. Faudree, Linda Lesniak

Publication date: 1 February 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77983-2_1

zbMATH Keywords

long cyclesbalanced tripartite graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Arc coverings of graphs
• Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
• Chorded pancyclicity in \(k\)-partite graphs
• Hamiltonicity in balanced \(k\)-partite graphs
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Edge condition for hamiltonicity in balanced tripartite graphs
• Hamiltonian cycles in k‐partite graphs
• Sufficient Conditions for Circuits in Graphs^†
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item