Existence of 3-regular subgraphs in Cartesian product of cycles
Let G be a graph obtained by taking the Cartesian product of finitely many cycles. It is known that G is bipancyclic, that is, G contains cycles of every even length from 4 to |V(G)|. We extend this result for the existence of 3-regular subgraphs in G. We prove that G contains a 3-regular, 2-connect...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860017301962 |