Shanmugasundaram Jeevadoss

According to our database, Shanmugasundaram Jeevadoss authored at least 4 papers between 2012 and 2016.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2016

Decomposition of Product Graphs into Paths and Cycles of Length Four.

Shanmugasundaram Jeevadoss, Appu Muthusamy

Graphs Comb., 2016

2015

Decomposition of complete bipartite multigraphs into paths and cycles having <i>k</i> edges.

Shanmugasundaram Jeevadoss, Appu Muthusamy

Discuss. Math. Graph Theory, 2015

2014

Decomposition of complete bipartite graphs into paths and cycles.

Shanmugasundaram Jeevadoss, Appu Muthusamy

Discret. Math., 2014

2012

Sufficient Condition for {<i>C</i> ₄, <i>C</i> _2<i>t</i>} - Decomposition of <i>K</i> _{2<i>m</i>, 2<i>n</i>} - An Improved Bound.

Shanmugasundaram Jeevadoss, Appu Muthusamy

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012