The following pages link to Bhalchandra D. Thatte (Q868401):
Displayed 26 items.
- A correct proof of the McMorris-Powers' theorem on the consensus of phylogenies (Q868402) (← links)
- Ancestries of a recombining diploid population (Q907129) (← links)
- A reconstruction problem related to balance equations. II: The general case (Q1297491) (← links)
- Some results and approaches for reconstruction conjectures (Q1313839) (← links)
- On the Nash-Williams' lemma in graph reconstruction theory (Q1325266) (← links)
- On a reconstruction problem (Q1343810) (← links)
- A reconstruction problem related to balance equations (Q1377699) (← links)
- Maximum parsimony on subsets of taxa (Q1625879) (← links)
- Reconstructing pedigrees: a stochastic perspective (Q1788666) (← links)
- Upper bounds on the automorphism group of a graph (Q1849961) (← links)
- Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model (Q1937885) (← links)
- Revisiting an equivalence between maximum parsimony and maximum likelihood methods in phylogenetics (Q2380829) (← links)
- The maximum agreement subtree problem (Q2446824) (← links)
- Invertibility of the TKF model of sequence evolution (Q2488650) (← links)
- Comments on a paper ``Reconstruction of a graph of order \(p\) from its \((p-1)\)-complements'' by E. Sampathkumar and L. Pushpa Latha (Q2565333) (← links)
- Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems (Q2583663) (← links)
- An Algebraic Formulation of the Graph Reconstruction Conjecture (Q2800593) (← links)
- Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question (Q3393428) (← links)
- (Q4552168) (← links)
- Some results on the reconstruction problems. <i>p</i>‐claw‐free, chordal, and <i>p</i><sub>4</sub>‐reducible graphs (Q4842708) (← links)
- On the Boolean dimension of a graph and other related parameters (Q5038202) (← links)
- The connected partition lattice of a graph and the reconstruction conjecture (Q5110651) (← links)
- The edge‐subgraph poset of a graph and the edge reconstruction conjecture (Q5207470) (← links)
- A construction of the abstract induced subgraph poset of a graph from its abstract edge subgraph poset (Q6355004) (← links)
- A refinement of Kelly's lemma for graph reconstruction for counting rooted subgraphs (Q6465317) (← links)
- Subgraph posets and graph reconstruction (Q6477891) (← links)