Star factorizations of graph products

DOI<59::AID-JGT1>3.0.CO;2-A 10.1002/1097-0118(200102)36:2<59::AID-JGT1>3.0.CO;2-AzbMath0977.05107OpenAlexW4250579791MaRDI QIDQ2707973

Charles Vanden Eynden, Darryn E. Bryant, Saad I. El-Zanati

Publication date: 3 July 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200102)36:2<59::aid-jgt1>3.0.co;2-a

zbMATH Keywords

Cayley graphgraph productstar factorizationgeneralized cube

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition of complete multigraphs into stars
• On the decomposition of a graph into stars
• Resolvable balanced bipartite designs
• On \(K_{1,k}\)-factorizations of a complete bipartite graph
• Complete bipartite factorisations by complete bipartite graphs
• Star-factorization of symmetric complete bipartite digraphs
• \(K_{1,p^2}\)-factorization of complete bipartite graphs
• Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws
• Balanced bipartite graphs may be completely star-factored
• On tree factorizations of K_n
• Factorizations of complete multipartite graphs into generalized cubes