default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuresh Manjanath Hegde
Person information
- affiliation: National Institute of Technology Karnataka, MACS, Mangalore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Nevil Anto
, Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Upper bounds on the acyclic chromatic index of degenerate graphs. Discret. Math. 347(4): 113898 (2024)- [j23]Suresh Manjanath Hegde, Lolita Priya Castelino:
Achromatic number of some classes of digraphs. Discret. Math. Algorithms Appl. 16(7): 2350090:1-2350090:13 (2024) - [i4]Subramanian Arumugam, Suresh Manjanath Hegde, Shashanka Kulamarva:
An improved upper bound for the domination number of a graph. CoRR abs/2401.02765 (2024) - 2023
- [j22]Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Acyclic chromatic index of chordless graphs. Discret. Math. 346(8): 113434 (2023) - [j21]Suresh Manjanath Hegde, Y. M. Saumya:
Maximum independent sets in a proper monograph determined through a signature. Discret. Math. Algorithms Appl. 15(3): 2250092:1-2250092:13 (2023) - [i3]Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Acyclic Chromatic Index of Chordless Graphs. CoRR abs/2302.01638 (2023) - [i2]Nevil Anto, Manu Basavaraju, Suresh Manjanath Hegde, Shashanka Kulamarva:
Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs. CoRR abs/2305.01948 (2023) - [i1]Suresh Manjanath Hegde, Shashanka Kulamarva:
A Graph-Theoretic Model for a Generic Three Jug Puzzle. CoRR abs/2308.13868 (2023) - 2021
- [j20]Shivarajkumar, M. A. Sriraj, Suresh Manjanath Hegde:
Graceful labeling of digraphs - a survey. AKCE Int. J. Graphs Comb. 18(3): 143-147 (2021) - 2020
- [j19]Suresh Manjanath Hegde, Suresh Dara:
Further results on Erdős-Faber-Lovász conjecture. AKCE Int. J. Graphs Comb. 17(1): 614-631 (2020)
2010 – 2019
- 2016
- [j18]Suresh Manjanath Hegde, Suresh Dara:
On clique convergence of graphs. AKCE Int. J. Graphs Comb. 13(3): 261-266 (2016) - [j17]Suresh Dara, Venkateshwarlu Deva, Suresh Manjanath Hegde, S. B. Rao, Thomas Zaslavsky:
The dynamic of the forest graph operator. Discuss. Math. Graph Theory 36(4): 899-913 (2016) - [j16]Suresh Manjanath Hegde, Kumudakshi:
Further Results on Graceful Directed Graphs. Electron. Notes Discret. Math. 53: 149-154 (2016) - 2015
- [j15]Suresh Manjanath Hegde, Lolita Priya Castelino:
Harmonious Colorings of Digraphs. Ars Comb. 119: 339-352 (2015) - [j14]Suresh Manjanath Hegde, Kumudakshi:
Graceful digraphs and complete mappings. Electron. Notes Discret. Math. 48: 151-156 (2015) - 2014
- [j13]Suresh Manjanath Hegde, Shivarajkumar:
On Graceful Unicyclic Wheels. Ars Comb. 117: 47-64 (2014) - 2013
- [j12]Suresh Manjanath Hegde, Shivarajkumar:
Two Conjectures on Graceful Digraphs. Graphs Comb. 29(4): 933-954 (2013) - 2012
- [j11]Suresh Manjanath Hegde, M. K. Sumana:
Further results on proper and strong set colorings of graphs. Australas. J Comb. 52: 55-66 (2012) - 2011
- [j10]Suresh Manjanath Hegde, Sudhakar Shetty, P. Shankaran:
Further Results On Super Edge-Magic Deficiency Of Graphs. Ars Comb. 99: 487-502 (2011)
2000 – 2009
- 2009
- [j9]Suresh Manjanath Hegde, Sudhakar Shetty:
Strongly indexable graphs and applications. Discret. Math. 309(21): 6160-6168 (2009) - [j8]Suresh Manjanath Hegde:
Set colorings of graphs. Eur. J. Comb. 30(4): 986-995 (2009) - 2007
- [j7]Suresh Manjanath Hegde, Mirka Miller:
Futher results on sequetially additive graphs. Discuss. Math. Graph Theory 27(2): 251-268 (2007) - 2003
- [j6]Suresh Manjanath Hegde, Sudhakar Shetty:
On magic graphs. Australas. J Comb. 27: 277-284 (2003) - [j5]Suresh Manjanath Hegde, Sudhakar Shetty:
Super Edge Least-Magic Graphs. Electron. Notes Discret. Math. 15: 97 (2003) - [j4]Suresh Manjanath Hegde:
Further Results on Set Sequential and Set Graceful Graphs. Electron. Notes Discret. Math. 15: 98-102 (2003) - 2001
- [j3]Lowell W. Beineke, Suresh Manjanath Hegde:
Strongly multiplicative graphs. Discuss. Math. Graph Theory 21(1): 63-75 (2001)
1990 – 1999
- 1991
- [j2]B. Devadas Acharya, Suresh Manjanath Hegde:
Strongly indexable graphs. Discret. Math. 93(2-3): 123-129 (1991) - 1990
- [j1]B. Devadas Acharya, Suresh Manjanath Hegde:
Arithmetic graphs. J. Graph Theory 14(3): 275-299 (1990)
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-10-23 21:23 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:
