- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Medha Dhurandhar
- J. Comb. Theory, Ser. B
- 1984

Here quadratic and cubic σ-polynomials are characterized, or, equivalently, chromatic polynomials of the graphs of order p, whose chromatic number is p − 2 or p − 3, are characterized. Also Robert… (More)

- Medha Dhurandhar
- J. Comb. Theory, Ser. B
- 1989

Although the chromatic number of a graph is not known in general, attempts have been made to find good bounds for the number. Here we prove that a K1,3-free and a {(K2 ∪ K1) + K2}-free graph has… (More)

- Medha Dhurandhar
- Discrete Mathematics
- 1982

Brooks' Theorem says that if for a graph G,@D(G)=n, then G is n-colourable, unless (1) n=2 and G has an odd cycle as a component, or (2) n>2 and K"n"+"1 is a component of G. In this paper we prove… (More)

Proceedings of the Indo-US bilateral workshop on accelerating botanicals/biologics agent development

- Nagi B Kumar, Medha Dhurandhar, +7 authors Balasubramaniam Jayaram
- 2013

- Medha Dhurandhar
- PDPTA
- 2003

- Medha Dhurandhar
- BMC Complementary and Alternative Medicine
- 2012

Purpose Ayurveda advocates a holistic, individualized approach for disease diagnostics/treatment. Taking cognizance of physiological variabilities, Ayurveda devised a subjective method of pulse… (More)

- Medha Dhurandhar
- 2017

Borodin & Kostochka conjectured that if maximum degree of a graph is greater than or equal to 9, then the chromatic number of the graph is less than or equal to maximum of {\omega} and maximum degree… (More)

- Akshara Kaginalkar, Sharbani Bhonsale, Medha Dhurandhar
- Software Engineering Research and Practice
- 2004

- Medha Dhurandhar
- 2014

Problem of finding an optimal upper bound for {\chi} of (3 Times K1)-free graphs is still open and pretty hard. It was proved by Choudum et al that upper bound on the {\chi} of {3 Times K1, {2 Times… (More)