A characterization of Hamiltonian prisms | Zendy

Paulraja P. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A characterization of Hamiltonian prisms

Author(s) -

Paulraja P.

Publication year - 1993

Publication title -

journal of graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 54

eISSN - 1097-0118

pISSN - 0364-9024

DOI - 10.1002/jgt.3190170205

Subject(s) - combinatorics , mathematics , hamiltonian path , bipartite graph , graph factorization , graph , prism , hamiltonian (control theory) , graph power , discrete mathematics , line graph , physics , optics , mathematical optimization

A characterization is established for a graph G to have a Hamilton cycle in G × K 2 , the prism over G . Moreover, it is shown that every 3‐connected graph has a 2‐connected spanning bipartite subgraph. Using this result, the existence of a Hamilton cycle in the prism over every 3‐connected cubic graph is established. Further, the existence of a Hamilton cycle in the prism over a cubic 2‐connected graph is also discussed. Earlier results in this direction are shown to be particular cases of the results obtained here. © 1993 John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research