$\widetilde{S}_k$-Factorization of the symmetric digraph of wreath product of graphs
From MaRDI portal
Publication:2931911
DOI10.1142/S1793830914500487zbMath1303.05154OpenAlexW1974828328MaRDI QIDQ2931911
Publication date: 28 November 2014
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830914500487
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
This page was built for publication: $\widetilde{S}_k$-Factorization of the symmetric digraph of wreath product of graphs