Existence of 3-regular subgraphs in Cartesian product of cycles

Let be a graph obtained by taking the Cartesian product of finitely many cycles. It is known that is bipancyclic, that is, contains cycles of every even length from 4 to We extend this result for the existence of 3-regular subgraphs in We prove that contains a 3-regular, 2-connected subgraph with ve...

Full description

Bibliographic Details
Main Authors: Y.M. Borse, J.B. Saraf
Format: Article
Language:English
Published: Taylor & Francis Group 2019-12-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:http://dx.doi.org/10.1016/j.akcej.2018.07.001