![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Bhalchandra D. Thatte
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j16]Maurice Pouzet, Hamza Si Kaddour, Bhalchandra D. Thatte:
On the Boolean dimension of a graph and other related parameters. Discret. Math. Theor. Comput. Sci. 23(2) (2021) - 2020
- [j15]Bhalchandra D. Thatte
:
The connected partition lattice of a graph and the reconstruction conjecture. J. Graph Theory 93(2): 181-202 (2020) - [c1]Maurice Pouzet, Hamza Si Kaddour, Bhalchandra D. Thatte:
A note on the Boolean dimension of a graph and other related parameters. ALGOS 2020: 55-59
2010 – 2019
- 2019
- [j14]Bhalchandra D. Thatte
:
The edge-subgraph poset of a graph and the edge reconstruction conjecture. J. Graph Theory 92(3): 287-303 (2019) - 2016
- [j13]Igor C. Oliveira, Bhalchandra D. Thatte:
An Algebraic Formulation of the Graph Reconstruction Conjecture. J. Graph Theory 81(4): 351-363 (2016) - 2013
- [j12]Daniel M. Martin, Bhalchandra D. Thatte:
The maximum agreement subtree problem. Discret. Appl. Math. 161(13-14): 1805-1817 (2013) - [i1]Igor C. Oliveira, Bhalchandra D. Thatte:
An algebraic formulation of the graph reconstruction conjecture. CoRR abs/1301.4121 (2013)
2000 – 2009
- 2008
- [j11]Bhalchandra D. Thatte:
Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question. SIAM J. Discret. Math. 22(3): 961-970 (2008) - 2007
- [j10]Bhalchandra D. Thatte:
A correct proof of the McMorris-Powers' theorem on the consensus of phylogenies. Discret. Appl. Math. 155(3): 423-427 (2007) - 2005
- [j9]Bhalchandra D. Thatte:
Kocay's Lemma, Whitney's Theorem, and some Polynomial Invariant Reconstruction Problems. Electron. J. Comb. 12 (2005) - 2002
- [j8]Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte:
Upper bounds on the automorphism group of a graph0. Discret. Math. 256(1-2): 489-493 (2002)
1990 – 1999
- 1999
- [j7]Bhalchandra D. Thatte:
G-reconstruction of graphs. Ars Comb. 54 (1999) - [j6]Bhalchandra D. Thatte:
A reconstruction problem related to balance equations II: The general case. Discret. Math. 194(1-3): 281-284 (1999) - 1997
- [j5]Bhalchandra D. Thatte:
A reconstruction problem related to balance equations. Discret. Math. 176(1-3): 279-284 (1997) - 1995
- [j4]Bhalchandra D. Thatte:
On a reconstruction problem. Discret. Math. 137(1-3): 387-388 (1995) - [j3]Bhalchandra D. Thatte:
Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs. J. Graph Theory 19(4): 549-561 (1995) - 1994
- [j2]Bhalchandra D. Thatte:
Some results and approaches for reconstruction conjectures. Discret. Math. 124(1-3): 193-216 (1994) - 1993
- [j1]Bhalchandra D. Thatte:
On the Nash-Williams' Lemma in Graph Reconstruction Theory. J. Comb. Theory B 58(2): 280-290 (1993)
![](https://dblp.org/img/cog.dark.24x24.png)
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-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint