15 citations · 26 across the 27 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
Decompositions of complete uniform multi-hypergraphs into Berge paths and cycles of arbitrary lengths
Ramin Javadi, Afsaneh Khodadadpour, Gholamreza Omidi
In 1981, Alspach conjectured that the complete graph could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This…
math.CO2016★ 5 cited
Edge Clique Cover of Claw-free Graphs
Ramin Javadi, Sepehr Hajebi
The smallest number of cliques, covering all edges of a graph , is called the (edge) clique cover number of and is denoted by . It is an easy observation that f…