Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
From MaRDI portal
Publication:1379832
DOI10.1016/S0012-365X(97)00138-6zbMath0890.05052OpenAlexW2140526538MaRDI QIDQ1379832
Publication date: 24 March 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00138-6
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Vertex-bipancyclicity of the generalized honeycomb tori ⋮ Orthogonal drawings and crossing numbers of the Kronecker product of two cycles ⋮ Unnamed Item ⋮ Distinguishing index of Kronecker product of two graphs ⋮ \([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
Cites Work
- 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
- Pancyclicity and extendability in strong products
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity