L. Pushpalatha

According to our database, L. Pushpalatha authored at least 7 papers between 1994 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2016

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha

Ars Comb., 2016

2012

Vertex coloring without large polychromatic stars.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha

Discret. Math., 2012

3-consecutive edge coloring of a graph.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha

Discret. Math., 2012

2011

Improper C-colorings of graphs.

Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpalatha, R. C. Vasundhara

Discret. Appl. Math., 2011

1998

Complement of a Graph: A Generalization.

E. Sampathkumar, L. Pushpalatha

Graphs Comb., 1998

1996

Strong weak domination and domination balance in a graph.

E. Sampathkumar, L. Pushpalatha

Discret. Math., 1996

1994

Set domination in graphs.

E. Sampathkumar, L. Pushpalatha

J. Graph Theory, 1994