SIAM Journal on Discrete Mathematics · 2010 · 10 citations · 4 references
ComputingComputer ScienceMathematicsAlgebraAlgorithmsCombinatoricsDirected Acyclic GraphsGraph AlgorithmsGraph TheoryHypercube NetworksNumber-theoretic AlgorithmsBipartite Graph RepresentationDirect Product RepresentationsDirect ProductsGraph EnumerationHypergraph Enumeration
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization $G\cong H\times K_2$. We apply this technique to the problems of factoring even cycles and hypercubes over the direct product. In the case of hypercubes, our work expands some known results by Brešar, Imrich, Klavžar, Rall, and Zmazek [Finite and infinite hypercubes as direct products, Australas. J. Combin., 36 (2006), pp. 83–90, and Hypercubes as direct products, SIAM J. Discrete Math., 18 (2005), pp. 778–786].
4
Factoring cardinal product graphs in polynomial time
Wilfried Imrich · Discrete Mathematics · 1998 · 48 citations
Boštjan Brešar, Wilfried Imrich, Sandi Klavžar et al. · SIAM Journal on Discrete Mathematics · 2005 · 45 citations
Natural Sciences, High-performance Computing, Combinatorics +9
On direct product cancellation of graphs
Richard H. Hammack · Discrete Mathematics · 2008 · 18 citations