Improved bounds on acyclic edge colouring. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (Electron. Notes Discret. Math., 2005)

Acyclic Edge Colouring of Outerplanar Graphs. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (AAIM, 2007)

Colored Trees in Edge-Colored Graphs. - Abdelfattah Abouelaoualim; Valentin Borozan; Yannis Manoussakis; Carlos A. J. Martinhon; Rahul Muthu; Rachid Saad (CTW, 2009)

On k-intersection edge colourings. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (Discuss. Math. Graph Theory, 2009)

Optimal acyclic edge colouring of grid like graphs. - Rahul Muthu; N. Narayanan 001; C. R. Subramanian 001 (Discret. Math., 2010)

Sufficient conditions for the existence of spanning colored trees in edge-colored graphs. - Raquel Águeda; Valentin Borozan; Yannis Manoussakis; Gervais Mendy; Rahul Muthu (Discret. Math., 2012)

Improved Upper Bounds on a'(G☐H). - Punit Mehta; Rahul Muthu; Gaurav Patel; Om Thakkar 001; Devanshi Vyas (CoRR, 2015)

Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness. - Mahipal Jadeja; Rahul Muthu; V. Sunitha (Electron. Notes Discret. Math., 2017)

Maximum colored trees in edge-colored graphs. - Valentin Borozan; Wenceslas Fernandez de la Vega; Yannis Manoussakis; Carlos A. J. Martinhon; Rahul Muthu; Hong Phong Pham; Rachid Saad (Eur. J. Comb., 2019)

Interactive Labelled Object Treemap: Visualization Tool for Multiple Hierarchies. - Mahipal Jadeja; Hitarth Kanakia; Rahul Muthu (FICTA (1), 2020)

Exactly k MSTs: How Many Vertices Suffice? - Apratim Dutta; Rahul Muthu; Anuj Tawari; V. Sunitha (COCOA (1), 2023)