@Article{Adamus2009,
author = "Adamus, Janusz",
title = "Edge condition for hamiltonicity in balanced tripartite graphs",
journal = "Opuscula Math.",
year = "2009",
volume = "29",
number = "4",
pages = "337--343",
doi = "http://dx.doi.org/10.7494/OpMath.2009.29.4.337",
url = "http://dx.doi.org/10.7494/OpMath.2009.29.4.337",
abstract = "A well-known theorem of Entringer and Schmeichel asserts that a balanced bipartite graph of order \(2n\) obtained from the complete balanced bipartite \(K_{n,n}\) by removing at most \(n-2\) edges, is bipancyclic. We prove an analogous result for balanced tripartite graphs: If \(G\) is a balanced tripartite graph of order \(3n\) and size at least \(3n^2-2n+2\), then \(G\) contains cycles of all lengths.",
keywords = "Hamilton cycle, pancyclicity, tripartite graph, edge condition",
issn = "1232-9274"
}