Some 4-valent, 3-connected, planar, almost pancyclic graphs. - Sheshayya A. Choudum (Discret. Math., 1977)

Characterizations of 2-variegated graphs and of 3-variegated graphs. - Vasanti N. Bhat-Nayak; Sheshayya A. Choudum; Ranjan N. Naik (Discret. Math., 1978)

On graphic and 3-hypergraphic sequences. - Sheshayya A. Choudum (Discret. Math., 1991)

On forcibly connected graphic sequences. - Sheshayya A. Choudum (Discret. Math., 1991)

Regular factors in K1, 3-free graphs. - Sheshayya A. Choudum; M. S. Paulraj (J. Graph Theory, 1991)

Edge-chromatic critical graphs and the existence of 1-factors. - Sheshayya A. Choudum (J. Graph Theory, 1993)

There are no edge-chromatic 4-critical graphs of order 12. - Sheshayya A. Choudum; K. Kayathri (Discret. Math., 1995)

Ordered and Canonical Ramsey Numbers of Stars. - Sheshayya A. Choudum; B. Ponnusamy (Graphs Comb., 1997)

An extension of Vizing's adjacency lemma on edge chromatic critical graphs. - Sheshayya A. Choudum; K. Kayathri (Discret. Math., 1999)

Graceful labelling of the union of paths and cycles. - Sheshayya A. Choudum; S. Pitchai Muthu Kishore (Discret. Math., 1999)

Ramsey numbers for transitive tournaments. - Sheshayya A. Choudum; B. Ponnusamy (Discret. Math., 1999)

Tenacity of complete graph products and grids. - Sheshayya A. Choudum; N. Priya (Networks, 1999)

Optimal fault-tolerant networks with a server. - Sheshayya A. Choudum; S. Sivagurunathan (Networks, 2000)

Tough-Maximum Graphs. - Sheshayya A. Choudum; N. Priya (Ars Comb., 2001)

Ordered Ramsey numbers. - Sheshayya A. Choudum; B. Ponnusamy (Discret. Math., 2002)

Augmented cubes. - Sheshayya A. Choudum; V. Sunitha (Networks, 2002)

Distance and Short Parallel Paths in Augmented Cubes. - Sheshayya A. Choudum; V. Sunitha (Electron. Notes Discret. Math., 2003)

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers. - E. Sampathkumar 001; B. Devadas Acharya; Siddani Bhaskara Rao; Sheshayya A. Choudum (Electron. Notes Discret. Math., 2003)

Dissolved Graphs and Strong Perfect Graph Conjecture. - Sheshayya A. Choudum; M. A. Shalu (Ars Comb., 2004)

Complete binary trees in folded and enhanced cubes. - Sheshayya A. Choudum; Usha Nandini Raghavan (Networks, 2004)

The class of {3K1, C4}-free graphs. - Sheshayya A. Choudum; M. A. Shalu (Australas. J Comb., 2005)

Perfect coloring and linearly chi-bound P6-free graphs. - Sheshayya A. Choudum; T. Karthick; M. A. Shalu (J. Graph Theory, 2007)

Embedding complete ternary trees into hypercubes. - Sheshayya A. Choudum; S. Lavanya 001 (Discuss. Math. Graph Theory, 2008)

Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs. - Sheshayya A. Choudum; T. Karthick; M. A. Shalu (Graphs Comb., 2008)

Automorphisms of augmented cubes. - Sheshayya A. Choudum; V. Sunitha (Int. J. Comput. Math., 2008)

Complete k-ary trees and Hamming graphs. - Sheshayya A. Choudum; S. Lavanya 001 (Australas. J Comb., 2009)

On embedding subclasses of height-balanced trees in hypercubes. - Sheshayya A. Choudum; Indhumathi Raman (Inf. Sci., 2009)

First-Fit coloring of {P5, K4-e}-free graphs. - Sheshayya A. Choudum; T. Karthick (Discret. Appl. Math., 2010)

Maximal cliques in {P2 UNION P3, C4}-free graphs. - Sheshayya A. Choudum; T. Karthick (Discret. Math., 2010)

Disjoint paths in hypercubes with prescribed origins and lengths. - Sheshayya A. Choudum; S. Lavanya 001; V. Sunitha (Int. J. Comput. Math., 2010)

Embedding a subclass of trees into hypercubes. - Sheshayya A. Choudum; S. Lavanya 001 (Discret. Math., 2011)

Embedding double starlike trees into hypercubes. - Sheshayya A. Choudum; S. Lavanya 001; V. Sunitha (Int. J. Comput. Math., 2011)

Embedding certain height-balanced trees and complete pm-ary trees into hypercubes. - Indhumathi Raman; Sheshayya A. Choudum (J. Discrete Algorithms, 2013)

Colouring of (P3UP2)-free graphs. - Arpitha P. Bharathi; Sheshayya A. Choudum (CoRR, 2016)

Colouring of ( P3 ∪ P2)-free graphs. - Arpitha P. Bharathi; Sheshayya A. Choudum (Graphs Comb., 2018)

Structural domination and coloring of some (P7, C7)-free graphs. - Sheshayya A. Choudum; T. Karthick; Manoj M. Belavadi (CoRR, 2019)

Structural domination and coloring of some (P7, C7)-free graphs. - Sheshayya A. Choudum; T. Karthick; Manoj M. Belavadi (Discret. Math., 2021)

Towards Optimal χ-Binding Functions of ($2K_1 cup K_2$)-Free Graphs and ($P_3 cup K_1$)-Free Graphs. - C. U. Angeliya; Sheshayya A. Choudum; Mayamma Joseph (Graphs Comb., 2025)