Appu Muthusamy

Orcid: 0000-0001-9014-6916

Affiliations:
  • Periyar University, Salem, Tamil Nadu, India


According to our database1, Appu Muthusamy authored at least 32 papers between 1995 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hamilton cycles in generalized Mycielski graphs.
Discret. Math. Algorithms Appl., October, 2024

2023
Decomposition of complete equipartite graphs into paths and cycles of length 2p.
Discret. Math., 2023

2021
Uniformly resolvable decompositions of K<sub>n</sub> into 1-factors and P<sub>k</sub>-factors.
Bull. ICA, 2021

2020
Gregarious kite factorization of tensor product of complete graphs.
Discuss. Math. Graph Theory, 2020

Decomposition of complete tripartite graphs into cycles and paths of length three.
Contributions Discret. Math., 2020

Decomposition of product graphs into paths and stars on five vertices.
AKCE Int. J. Graphs Comb., 2020

Decomposition of complete bipartite graphs into cycles and stars with four edges.
AKCE Int. J. Graphs Comb., 2020

2019
Decomposition of product graphs into paths and stars with three edges.
Bull. ICA, 2019

Cycle frames and the Oberwolfach problem.
AKCE Int. J. Graphs Comb., 2019

2017
Evenly partite star factorization of symmetric digraph of wreath product of graphs.
AKCE Int. J. Graphs Comb., 2017

2016
Decomposition of Product Graphs into Paths and Cycles of Length Four.
Graphs Comb., 2016

Note on three table Oberwolfach problem.
Electron. Notes Discret. Math., 2016

Gregarious Kite Decomposition of Tensor Product of Complete Graphs.
Electron. Notes Discret. Math., 2016

Perfect set of Euler tours of <i>K<sub>p, p, p</sub></i>.
Discuss. Math. Graph Theory, 2016

3-Simple 2-Fold 5-Cycle Systems.
Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

P_3 -Factorization of Triangulated Cartesian Product of Complete Graph of Odd Order.
Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

2015
Decomposition of complete bipartite multigraphs into paths and cycles having <i>k</i> edges.
Discuss. Math. Graph Theory, 2015

Hamilton cycle rich 2-factorization of complete bipartite graphs.
Discret. Math. Algorithms Appl., 2015

Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs.
Discret. Math. Algorithms Appl., 2015

P<sub>3</sub>-factorization of triangulated Cartesian product of complete graphs.
Discret. Math. Algorithms Appl., 2015

2014
-Factorization of the symmetric digraph of wreath product of graphs.
Discret. Math. Algorithms Appl., 2014

P<sub>5</sub>-Factorization of Cartesian Product of graphs.
Discret. Math. Algorithms Appl., 2014

Decomposition of complete bipartite graphs into paths and cycles.
Discret. Math., 2014

2013
Symmetric Hamilton cycle decompositions of complete multigraphs.
Discuss. Math. Graph Theory, 2013

2012
Hamilton Cycle Rich 2-Factorization of Complete Equipartite Graphs-II.
Graphs Comb., 2012

Bipartite variation of the cheesecake factory problem: mH(k, 2l+1)-factorization of K<sub>n, n</sub>.
Discret. Math., 2012

Sufficient Condition for {<i>C</i> <sub>4</sub>, <i>C</i> <sub>2<i>t</i> </sub>} - Decomposition of <i>K</i> <sub>2<i>m</i>, 2<i>n</i> </sub> - An Improved Bound.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2006
On Resolvable Multipartite G-Designs II.
Graphs Comb., 2006

2004
On Resolvable Multipartite <i>G</i>-Designs.
Graphs Comb., 2004

1999
Path factorizations of complete multipartite graphs.
Discret. Math., 1999

1995
Hamilton Cycle Decomposition of Line Graphs and a Conjecture of Bermond.
J. Comb. Theory B, 1995

Factorizations of product graphs into cycles of uniform length.
Graphs Comb., 1995


  Loading...