Decomposition of the product of cycles based on degree partition

DOI10.7151/dmgt.2066zbMath1401.05230OpenAlexW2796280580WikidataQ130036359 ScholiaQ130036359MaRDI QIDQ1630940

Y. M. Borse, S. R. Shaikh

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2066

zbMATH Keywords

hypercubeCartesian productregularspanning subgraphbipancyclic\(n\)-connected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Unnamed Item ⋮ Existence of 3-regular subgraphs in Cartesian product of cycles

Cites Work

• Panconnectivity and edge-pancyclicity of multidimensional torus networks
• Fault diameter of Cartesian product graphs
• Honeycomb toroidal graphs are Cayley graphs
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Cycle factorizations of cycle products
• Kreuzungsfreie a,b-Wege in endlichen Graphen
• Decomposition of hypercubes into regular connected bipancyclic subgraphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
• Decomposing hypercubes into regular connected subgraphs
• Hamiltonian decompositions of products of cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of the product of cycles based on degree partition