Set domination in graphs. - E. Sampathkumar 001; L. Pushpalatha (J. Graph Theory, 1994)

Strong weak domination and domination balance in a graph. - E. Sampathkumar 001; L. Pushpalatha (Discret. Math., 1996)

Complement of a Graph: A Generalization. - E. Sampathkumar 001; L. Pushpalatha (Graphs Comb., 1998)

Improper C-colorings of graphs. - Csilla Bujtás; E. Sampathkumar 001; Zsolt Tuza; L. Pushpalatha; R. C. Vasundhara (Discret. Appl. Math., 2011)

3-consecutive edge coloring of a graph. - Csilla Bujtás; E. Sampathkumar 001; Zsolt Tuza; Charles Dominic; L. Pushpalatha (Discret. Math., 2012)

Vertex coloring without large polychromatic stars. - Csilla Bujtás; E. Sampathkumar 001; Zsolt Tuza; Charles Dominic; L. Pushpalatha (Discret. Math., 2012)

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. - Csilla Bujtás; E. Sampathkumar 001; Zsolt Tuza; Charles Dominic; L. Pushpalatha (Ars Comb., 2016)