Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
From MaRDI portal
Publication:1379832
DOI10.1016/S0012-365X(97)00138-6zbMath0890.05052MaRDI QIDQ1379832
Publication date: 24 March 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Orthogonal drawings and crossing numbers of the Kronecker product of two cycles, \([r,s,t\)-colorings of graph products], Perfect \(r\)-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh, Edge-pancyclicity of recursive circulants, Characterizing \(r\)-perfect codes in direct products of two and three cycles, Vertex-bipancyclicity of the generalized honeycomb tori
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decompositions of the Kronecker product of a cycle and a path into long cycles and long paths
- Factorizations of product graphs into cycles of uniform length
- Factorisations of 4-regular graphs and Petersen's theorem
- Pancyclic graphs. I
- Bipartite graphs with cycles of all even lengths