25 citations · 46 across the 5 of their papers we have counts for
5 papers
Embedding factorizations for 3-uniform hypergraphs
Amin Bahmanian, Chris Rodger
In this paper, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address t…
Embedding an Edge-colored into a Hamiltonian Decomposition of
Amin Bahmanian, Chris Rodger
Let be a graph with parts, each part having size , in which the multiplicity of each pair of vertices in the same part (in different parts) is (, res…
What are graph amalgamations?
Amin Bahmanian, Chris Rodger
In this paper, a survey about recent progress on problems solved using graph amalgamations is presented, along with some new results with complete proofs, and some related open pro…
Multiply Balanced Edge Colorings of Multigraphs
Amin Bahmanian, Chris Rodger
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so…
On the Number of Rainbow Spanning Trees in Edge-Colored Complete Graphs
Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry +1
A spanning tree of a properly edge-colored complete graph, , is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectur…