E. Sampathkumar

According to our database1, E. Sampathkumar authored at least 19 papers between 1976 and 2016.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

2014
Color energy of a unitary Cayley graph.
Discuss. Math. Graph Theory, 2014

2013
Coloring of signed graphs.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Vertex coloring without large polychromatic stars.
Discret. Math., 2012

3-consecutive edge coloring of a graph.
Discret. Math., 2012

2011
Improper C-colorings of graphs.
Discret. Appl. Math., 2011

2010
3-consecutive C-colorings of graphs.
Discuss. Math. Graph Theory, 2010

2003
Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.
Electron. Notes Discret. Math., 2003

Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering.
Electron. Notes Discret. Math., 2003

1998
Complement of a Graph: A Generalization.
Graphs Comb., 1998

1996
Strong weak domination and domination balance in a graph.
Discret. Math., 1996

1994
Set domination in graphs.
J. Graph Theory, 1994

A generalization of chromatic index.
Discret. Math., 1994

1993
Generalizations of independence and chromatic numbers of a graph.
Discret. Math., 1993

1992
A generalization of Menger's theorem for certain unicyclic graphs.
Graphs Comb., 1992

1990
The least point covering and domination numbers of a graph.
Discret. Math., 1990

1989
Chromatic partitions of a graph.
Discret. Math., 1989

1980
Reconstruction of a Pair of Graphs from their Concatenations.
SIAM J. Matrix Anal. Appl., 1980

1976
Partition graphs and coloring numbers of a graph.
Discret. Math., 1976


  Loading...