default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShailesh K. Tipnis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j18]Saad I. El-Zanati, Marie Ermete, James Hasty, Michael Plantholt, Shailesh K. Tipnis:
On decomposing regular graphs into isomorphic double-stars. Discuss. Math. Graph Theory 35(1): 73-79 (2015)- [j17]Ajit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis:
The complexity of P4-decomposition of regular graphs and multigraphs. Discret. Math. Theor. Comput. Sci. 17(2): 63-76 (2015) - 2014
- [j16]Saad I. El-Zanati, Michael Plantholt
, Shailesh K. Tipnis:
On decomposing even regular multigraphs into small isomorphic trees. Discret. Math. 325: 47-51 (2014) - 2013
- [j15]Arthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis:
Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs. Graphs Comb. 29(3): 359-364 (2013) - 2011
- [j14]Shailesh K. Tipnis, Michael Plantholt, Kaushal N. Badheka:
On a well-spread halving of directed multigraphs. Ars Comb. 100: 485-491 (2011) - [j13]Ajit A. Diwan, Josh B. Frye, Michael Plantholt, Shailesh K. Tipnis:
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph. Discret. Math. 311(21): 2556-2562 (2011) - 2009
- [j12]Michael Plantholt, Shailesh K. Tipnis:
Vertex-Oriented Hamilton Cycles in Directed Graphs. Electron. J. Comb. 16(1) (2009) - [j11]Heather Jordon, Richard McBride, Shailesh K. Tipnis:
The convex hull of degree sequences of signed graphs. Discret. Math. 309(19): 5841-5848 (2009) - 2007
- [j10]Shailesh K. Tipnis, Michael Plantholt:
On a well-spread halving of regular multigraphs. Ars Comb. 83 (2007) - 2002
- [j9]Saad I. El-Zanati, Shailesh K. Tipnis, Charles Vanden Eynden:
A generalization of the Oberwolfach problem. J. Graph Theory 41(2): 151-161 (2002) - 2001
- [j8]Michael Plantholt, Shailesh K. Tipnis:
All Regular Multigraphs of Even Order and High Degree Are 1-factorable. Electron. J. Comb. 8(1) (2001) - 1999
- [j7]Michael Plantholt, Shailesh K. Tipnis:
On the list chromatic index of nearly bipartite multigraphs. Australas. J Comb. 19: 157-170 (1999) - 1997
- [j6]Michael Plantholt, Shailesh K. Tipnis:
The chromatic index of multigraphs of order at most 10. Discret. Math. 177(1-3): 185-193 (1997) - [j5]Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis:
Extensions of some factorization results from simple graphs to multigraphs. J. Graph Theory 24(4): 291-295 (1997) - 1995
- [j4]Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis:
Factorization of regular multigraphs into regular graphs. J. Graph Theory 19(1): 93-105 (1995) - 1990
- [j3]Michael Plantholt, Shailesh K. Tipnis:
The chromatic index of multigraphs that are nearly full. Discret. Math. 82(2): 197-207 (1990) - 1989
- [j2]Shailesh K. Tipnis, Leslie E. Trotter Jr.:
A generalization of Robacker's theorem. Discret. Math. 74(1-2): 245-252 (1989) - [j1]Shailesh K. Tipnis, Leslie E. Trotter Jr.:
Node-Packing Problems with Integer Rounding Properties. SIAM J. Discret. Math. 2(3): 407-412 (1989)
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 2025-01-09 13:14 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:
