Decomposition of product graphs into paths and cycles of length four

DOI10.1007/S00373-015-1564-ZzbMath1331.05182OpenAlexW1989116585MaRDI QIDQ5964986

Shanmugasundaram Jeevadoss, Appu Muthusamy

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1564-z

zbMATH Keywords

cyclepathgraph decompositionproduct graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (5)

Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Decomposition of hypercube graphs into paths and cycles of length four ⋮ Decomposition of complete equipartite graphs into paths and cycles of length \(2p\) ⋮ Decompositions of line graphs of complete graphs into paths and cycles ⋮ Decomposition of product graphs into paths and stars on five vertices

Cites Work

• Decomposition of complete bipartite graphs into paths and cycles
• Decomposition of complete graphs into paths and stars
• Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposition of \(K_{m,n}\) into short cycles
• Multidesigns for graph-pairs of order 4 and 5
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decomposition of complete bipartite graphs into paths and stars with same number of edges
• Decomposition of complete graphs into cycles and stars
• Multidecompositions of the balanced complete bipartite graph into paths and stars
• Multidecompositions of several graph products
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m,2n – An Improved Bound
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of product graphs into paths and cycles of length four