TY - JOUR
T1 - Square Hamiltonian cycles in graphs with maximal 4-cliques
AU - Kierstead, Henry
AU - Quintana, Juan
N1 - Funding Information:
* Corresponding author. E-mail: kierstead@math.la.asu.edu. t Research partially supported by Office of Naval Research grant NOOO14-90-J-1206.
PY - 1998/1/1
Y1 - 1998/1/1
N2 - The square of a graph is obtained by adding additional edges joining all pairs of vertices with distance two in the original graph. Pósa conjectured that if G is a simple graph on n vertices with minimum degree 2n/3, then G contains the square of a hamiltonian cycle. We show that Pósa's conjecture holds for graphs that in addition contain a maximal 4-clique.
AB - The square of a graph is obtained by adding additional edges joining all pairs of vertices with distance two in the original graph. Pósa conjectured that if G is a simple graph on n vertices with minimum degree 2n/3, then G contains the square of a hamiltonian cycle. We show that Pósa's conjecture holds for graphs that in addition contain a maximal 4-clique.
UR - http://www.scopus.com/inward/record.url?scp=0037944986&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037944986&partnerID=8YFLogxK
U2 - 10.1016/S0012-365X(97)81819-5
DO - 10.1016/S0012-365X(97)81819-5
M3 - Article
AN - SCOPUS:0037944986
SN - 0012-365X
VL - 178
SP - 81
EP - 92
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -