default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSheshayya A. Choudum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j35]Sheshayya A. Choudum, T. Karthick
, Manoj M. Belavadi:
Structural domination and coloring of some (P7, C7)-free graphs. Discret. Math. 344(3): 112244 (2021)
2010 – 2019
- 2019
- [i2]Sheshayya A. Choudum, T. Karthick, Manoj M. Belavadi:
Structural domination and coloring of some (P7, C7)-free graphs. CoRR abs/1907.05018 (2019) - 2018
- [j34]Arpitha P. Bharathi, Sheshayya A. Choudum:
Colouring of ( P3 ∪ P2)-free graphs. Graphs Comb. 34(1): 97-107 (2018) - 2016
- [i1]Arpitha P. Bharathi, Sheshayya A. Choudum:
Colouring of (P3UP2)-free graphs. CoRR abs/1610.07177 (2016) - 2013
- [j33]Indhumathi Raman, Sheshayya A. Choudum:
Embedding certain height-balanced trees and complete pm-ary trees into hypercubes. J. Discrete Algorithms 22: 53-65 (2013) - 2011
- [j32]Sheshayya A. Choudum, S. Lavanya:
Embedding a subclass of trees into hypercubes. Discret. Math. 311(10-11): 866-871 (2011) - [j31]Sheshayya A. Choudum, S. Lavanya, V. Sunitha:
Embedding double starlike trees into hypercubes. Int. J. Comput. Math. 88(1): 1-5 (2011) - 2010
- [j30]Sheshayya A. Choudum, T. Karthick:
First-Fit coloring of {P5, K4-e}-free graphs. Discret. Appl. Math. 158(6): 620-626 (2010) - [j29]Sheshayya A. Choudum, T. Karthick:
Maximal cliques in {P2 UNION P3, C4}-free graphs. Discret. Math. 310(23): 3398-3403 (2010) - [j28]Sheshayya A. Choudum, S. Lavanya, V. Sunitha:
Disjoint paths in hypercubes with prescribed origins and lengths. Int. J. Comput. Math. 87(8): 1692-1708 (2010)
2000 – 2009
- 2009
- [j27]Sheshayya A. Choudum, S. Lavanya:
Complete k-ary trees and Hamming graphs. Australas. J Comb. 45: 15-24 (2009) - [j26]Sheshayya A. Choudum, Indhumathi Raman:
On embedding subclasses of height-balanced trees in hypercubes. Inf. Sci. 179(9): 1333-1347 (2009) - 2008
- [j25]Sheshayya A. Choudum, S. Lavanya:
Embedding complete ternary trees into hypercubes. Discuss. Math. Graph Theory 28(3): 463-476 (2008) - [j24]Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Linear Chromatic Bounds for a Subfamily of 3 K 1-free Graphs. Graphs Comb. 24(5): 413-428 (2008) - [j23]Sheshayya A. Choudum, V. Sunitha:
Automorphisms of augmented cubes. Int. J. Comput. Math. 85(11): 1621-1627 (2008) - 2007
- [j22]Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Perfect coloring and linearly chi-bound P6-free graphs. J. Graph Theory 54(4): 293-306 (2007) - 2005
- [j21]Sheshayya A. Choudum, M. A. Shalu:
The class of {3K1, C4}-free graphs. Australas. J Comb. 32: 111-116 (2005) - 2004
- [j20]Sheshayya A. Choudum, M. A. Shalu:
Dissolved Graphs and Strong Perfect Graph Conjecture. Ars Comb. 73 (2004) - [j19]Sheshayya A. Choudum, Usha Nandini Raghavan:
Complete binary trees in folded and enhanced cubes. Networks 43(4): 266-272 (2004) - 2003
- [j18]Sheshayya A. Choudum, V. Sunitha:
Distance and Short Parallel Paths in Augmented Cubes. Electron. Notes Discret. Math. 15: 64 (2003) - [j17]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) - 2002
- [j16]Sheshayya A. Choudum, B. Ponnusamy:
Ordered Ramsey numbers. Discret. Math. 247(1-3): 79-92 (2002) - [j15]Sheshayya A. Choudum, V. Sunitha:
Augmented cubes. Networks 40(2): 71-84 (2002) - 2001
- [j14]Sheshayya A. Choudum, N. Priya:
Tough-Maximum Graphs. Ars Comb. 61 (2001) - 2000
- [j13]Sheshayya A. Choudum, S. Sivagurunathan:
Optimal fault-tolerant networks with a server. Networks 35(2): 157-160 (2000)
1990 – 1999
- 1999
- [j12]Sheshayya A. Choudum, K. Kayathri:
An extension of Vizing's adjacency lemma on edge chromatic critical graphs. Discret. Math. 206(1-3): 97-103 (1999) - [j11]Sheshayya A. Choudum, S. Pitchai Muthu Kishore:
Graceful labelling of the union of paths and cycles. Discret. Math. 206(1-3): 105-117 (1999) - [j10]Sheshayya A. Choudum, B. Ponnusamy:
Ramsey numbers for transitive tournaments. Discret. Math. 206(1-3): 119-129 (1999) - [j9]Sheshayya A. Choudum, N. Priya:
Tenacity of complete graph products and grids. Networks 34(3): 192-196 (1999) - 1997
- [j8]Sheshayya A. Choudum, B. Ponnusamy:
Ordered and Canonical Ramsey Numbers of Stars. Graphs Comb. 13(2): 147-158 (1997) - 1995
- [j7]Sheshayya A. Choudum, K. Kayathri:
There are no edge-chromatic 4-critical graphs of order 12. Discret. Math. 141(1-3): 67-73 (1995) - 1993
- [j6]Sheshayya A. Choudum:
Edge-chromatic critical graphs and the existence of 1-factors. J. Graph Theory 17(1): 23-29 (1993) - 1991
- [j5]Sheshayya A. Choudum:
On graphic and 3-hypergraphic sequences. Discret. Math. 87(1): 91-95 (1991) - [j4]Sheshayya A. Choudum:
On forcibly connected graphic sequences. Discret. Math. 96(3): 175-181 (1991) - [j3]Sheshayya A. Choudum, M. S. Paulraj:
Regular factors in K1, 3-free graphs. J. Graph Theory 15(3): 259-265 (1991)
1970 – 1979
- 1978
- [j2]Vasanti N. Bhat-Nayak, Sheshayya A. Choudum, Ranjan N. Naik:
Characterizations of 2-variegated graphs and of 3-variegated graphs. Discret. Math. 23(1): 17-22 (1978) - 1977
- [j1]Sheshayya A. Choudum:
Some 4-valent, 3-connected, planar, almost pancyclic graphs. Discret. Math. 18(2): 125-129 (1977)
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-07 21:20 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:
