default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDE. Sampathkumar 0001
Person information
- affiliation: University of Mysore, Department of Mathematics, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j18]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. Ars Comb. 128: 165-173 (2016)- 2014
- [j17]Chandrashekar Adiga, E. Sampathkumar
, M. A. Sriraj:
Color energy of a unitary Cayley graph. Discuss. Math. Graph Theory 34(4): 707-721 (2014) - 2012
- [j16]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
3-consecutive edge coloring of a graph. Discret. Math. 312(3): 561-573 (2012) - [j15]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
Vertex coloring without large polychromatic stars. Discret. Math. 312(14): 2102-2108 (2012) - 2011
- [j14]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpalatha, R. C. Vasundhara:
Improper C-colorings of graphs. Discret. Appl. Math. 159(4): 174-186 (2011) - 2010
- [j13]Csilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza:
3-consecutive C-colorings of graphs. Discuss. Math. Graph Theory 30(3): 393-405 (2010) - 2003
- [j12]E. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum:
Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers. Electron. Notes Discret. Math. 15: 164-167 (2003) - [j11]E. Sampathkumar, B. Devadas Acharya, Purnima Gupta:
Studying Properties of Graphs through Their k-vertex Subsets II. Notions of domination, coloring and covering. Electron. Notes Discret. Math. 15: 168-174 (2003) - 1998
- [j10]E. Sampathkumar, L. Pushpalatha:
Complement of a Graph: A Generalization. Graphs Comb. 14(4): 377-392 (1998) - 1996
- [j9]E. Sampathkumar, L. Pushpalatha:
Strong weak domination and domination balance in a graph. Discret. Math. 161(1-3): 235-242 (1996) - 1994
- [j8]E. Sampathkumar, G. D. Kamath:
A generalization of chromatic index. Discret. Math. 124(1-3): 173-177 (1994) - [j7]E. Sampathkumar, L. Pushpalatha:
Set domination in graphs. J. Graph Theory 18(5): 489-495 (1994) - 1993
- [j6]E. Sampathkumar:
Generalizations of independence and chromatic numbers of a graph. Discret. Math. 115(1-3): 245-251 (1993) - 1992
- [j5]E. Sampathkumar:
A generalization of Menger's theorem for certain unicyclic graphs. Graphs Comb. 8(4): 377-380 (1992) - 1990
- [j4]E. Sampathkumar:
The least point covering and domination numbers of a graph. Discret. Math. 86(1-3): 137-142 (1990) - 1989
- [j3]E. Sampathkumar, C. V. Venkatachalam:
Chromatic partitions of a graph. Discret. Math. 74(1-2): 227-239 (1989) - 1980
- [j2]Sukhamay Kundu, E. Sampathkumar, James B. Shearer, Dean Sturtevant:
Reconstruction of a Pair of Graphs from their Concatenations. SIAM J. Algebraic Discret. Methods 1(2): 228-231 (1980) - 1976
- [j1]E. Sampathkumar, V. N. Bhave:
Partition graphs and coloring numbers of a graph. Discret. Math. 16(1): 57-60 (1976)
Informal and Other Publications
- 2013
- [i1]Shariefuddin Pirzada, Muhammad Ali Khan, E. Sampathkumar:
Coloring of signed graphs. CTW 2013: 191-195
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
