default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAppu Muthusamy
Person information
- affiliation: Periyar University, Salem, Tamil Nadu, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]L. Panneerselvam
, S. Ganesamurthy, Appu Muthusamy:
Hamilton cycles in generalized Mycielski graphs. Discret. Math. Algorithms Appl. 16(7): 2350088:1-2350088:10 (2024)- 2023
- [j28]A. Pauline Ezhilarasi, Appu Muthusamy:
Decomposition of complete equipartite graphs into paths and cycles of length 2p. Discret. Math. 346(1): 113160 (2023) - 2021
- [j27]M. Ilayaraja, A. Shanmuga Vadivu, Appu Muthusamy:
Uniformly resolvable decompositions of Kn into 1-factors and Pk-factors. Bull. ICA 93: 126-142 (2021) - 2020
- [j26]M. Ilayaraja, Appu Muthusamy:
Decomposition of complete bipartite graphs into cycles and stars with four edges. AKCE Int. J. Graphs Comb. 17(3): 697-702 (2020) - [j25]M. Ilayaraja, K. Sowndhariya, Appu Muthusamy:
Decomposition of product graphs into paths and stars on five vertices. AKCE Int. J. Graphs Comb. 17(3): 777-783 (2020) - [j24]Shanmugasundaram Priyadarsini, Appu Muthusamy:
Decomposition of complete tripartite graphs into cycles and paths of length three. Contributions Discret. Math. 15(3): 117-129 (2020) - [j23]A. Tamil Elakkiya, Appu Muthusamy:
Gregarious kite factorization of tensor product of complete graphs. Discuss. Math. Graph Theory 40(1): 7-24 (2020)
2010 – 2019
- 2019
- [j22]Andiyappan Shanmuga Vadivu, Appu Muthusamy:
Cycle frames and the Oberwolfach problem. AKCE Int. J. Graphs Comb. 16(1): 83-95 (2019) - [j21]A. Pauline Ezhilarasi, Appu Muthusamy:
Decomposition of product graphs into paths and stars with three edges. Bull. ICA 87: 47-74 (2019) - 2017
- [j20]P. Hemalatha, Appu Muthusamy:
Evenly partite star factorization of symmetric digraph of wreath product of graphs. AKCE Int. J. Graphs Comb. 14(1): 54-62 (2017) - 2016
- [j19]Thamodharan Govindan, Appu Muthusamy:
Perfect set of Euler tours of Kp, p, p. Discuss. Math. Graph Theory 36(4): 783-796 (2016) - [j18]A. Tamil Elakkiya, Appu Muthusamy:
Gregarious Kite Decomposition of Tensor Product of Complete Graphs. Electron. Notes Discret. Math. 53: 83-96 (2016) - [j17]A. Shanmuga Vadivu, Appu Muthusamy:
Note on three table Oberwolfach problem. Electron. Notes Discret. Math. 53: 97-112 (2016) - [j16]Shanmugasundaram Jeevadoss, Appu Muthusamy:
Decomposition of Product Graphs into Paths and Cycles of Length Four. Graphs Comb. 32(1): 199-223 (2016) - [c3]R. Sangeetha, Appu Muthusamy:
3-Simple 2-Fold 5-Cycle Systems. ICTCSDM 2016: 357-361 - [c2]A. Tamil Elakkiya, Appu Muthusamy:
P_3 -Factorization of Triangulated Cartesian Product of Complete Graph of Odd Order. ICTCSDM 2016: 425-434 - 2015
- [j15]A. Tamil Elakkiya, Appu Muthusamy:
P3-factorization of triangulated Cartesian product of complete graphs. Discret. Math. Algorithms Appl. 7(1): 1450066:1-1450066:28 (2015) - [j14]R. Sangeetha, Appu Muthusamy:
Hamilton cycle rich 2-factorization of complete bipartite graphs. Discret. Math. Algorithms Appl. 7(3): 1550026:1-1550026:19 (2015) - [j13]Thamodharan Govindan, Appu Muthusamy:
Nonexistence of a pair of arc disjoint directed Hamilton cycles on line digraphs of 2-diregular digraphs. Discret. Math. Algorithms Appl. 7(3): 1550034:1-1550034:6 (2015) - [j12]Shanmugasundaram Jeevadoss, Appu Muthusamy:
Decomposition of complete bipartite multigraphs into paths and cycles having k edges. Discuss. Math. Graph Theory 35(4): 715-731 (2015) - 2014
- [j11]Shanmugasundaram Jeevadoss, Appu Muthusamy:
Decomposition of complete bipartite graphs into paths and cycles. Discret. Math. 331: 98-108 (2014) - [j10]A. Tamil Elakkiya, Appu Muthusamy:
P5-Factorization of Cartesian Product of graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - [j9]P. Hemalatha, Appu Muthusamy:
-Factorization of the symmetric digraph of wreath product of graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - 2013
- [j8]V. Chitra, Appu Muthusamy:
Symmetric Hamilton cycle decompositions of complete multigraphs. Discuss. Math. Graph Theory 33(4): 695-707 (2013) - 2012
- [j7]V. Chitra, Appu Muthusamy:
Bipartite variation of the cheesecake factory problem: mH(k, 2l+1)-factorization of Kn, n. Discret. Math. 312(2): 381-389 (2012) - [j6]R. Sangeetha, Appu Muthusamy:
Hamilton Cycle Rich 2-Factorization of Complete Equipartite Graphs-II. Graphs Comb. 28(6): 877-887 (2012) - [c1]Shanmugasundaram Jeevadoss, Appu Muthusamy:
Sufficient Condition for {C 4, C 2t } - Decomposition of K 2m, 2n - An Improved Bound. IWOCA 2012: 143-147
2000 – 2009
- 2006
- [j5]M. G. Karunambigai, Appu Muthusamy:
On Resolvable Multipartite G-Designs II. Graphs Comb. 22(1): 59-67 (2006) - 2004
- [j4]Appu Muthusamy:
On Resolvable Multipartite G-Designs. Graphs Comb. 20(3): 377-382 (2004)
1990 – 1999
- 1999
- [j3]Appu Muthusamy, P. Paulraja:
Path factorizations of complete multipartite graphs. Discret. Math. 195(1-3): 181-201 (1999) - 1995
- [j2]Appu Muthusamy, P. Paulraja:
Factorizations of product graphs into cycles of uniform length. Graphs Comb. 11(1): 69-90 (1995) - [j1]Appu Muthusamy, P. Paulraja:
Hamilton Cycle Decomposition of Line Graphs and a Conjecture of Bermond. J. Comb. Theory B 64(1): 1-16 (1995)
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-11-07 21:37 CET 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:
