TY  - JOUR
ID  - Adamus2009
LB  - Adamus2009
AU  - Adamus, Janusz
TI  - Edge condition for hamiltonicity in balanced tripartite graphs
ST  - Edge condition for hamiltonicity in balanced tripartite graphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2009
VL  - 29
IS  - 4
SP  - 337
EP  - 343
DO  - http://dx.doi.org/10.7494/OpMath.2009.29.4.337
UR  - http://dx.doi.org/10.7494/OpMath.2009.29.4.337
AB  - 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.
KW  - Hamilton cycle
KW  - pancyclicity
KW  - tripartite graph
KW  - edge condition
SN  - 1232-9274
ER  -