Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Medha Dhurandhar"'
Autor:
Libin Jia, Jeffrey D. White, Shrikant Anant, Fazlul H. Sarkar, Ernest T. Hawk, Bharat B. Aggarwal, Devarajan Karunagaran, Julie Djeu, Medha Dhurandhar, Kenyon G. Daniel, Lalit Kumar, Anil Srivastava, Rana P. Singh, Bhyravabhotla Jayaram, Rajendra Joshi, Omer Kucuk, Nagi B. Kumar, Jinhui Dou, G. J. Samathanam, Mokenge P. Malafa, Madhuri Kararala, Maqsood Siddiqi, Gary Deng
Publikováno v:
Cancer Medicine
With the evolving evidence of the promise of botanicals/biologics for cancer chemoprevention and treatment, an Indo-U.S. collaborative Workshop focusing on “Accelerating Botanicals Agent Development Research for Cancer Chemoprevention and Treatment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0879bd6f0fd41ecb4305d66dfad8d45e
http://europepmc.org/articles/PMC3797562
http://europepmc.org/articles/PMC3797562
Autor:
Medha Dhurandhar
Publikováno v:
Journal of Combinatorial Theory, Series B. 46:1-6
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 chromatic number at most equal to its maximum clique
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c468c7008101b29e76a3098fce23a468
https://doi.org/10.1016/0095-8956(89)90002-6
https://doi.org/10.1016/0095-8956(89)90002-6
Autor:
Medha Dhurandhar
Publikováno v:
Journal of Combinatorial Theory, Series B. 37(3):210-220
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 Korfhage's conjecture that if σ2 + bσ + a is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16dca01c8b2bb53a9a9ca19f956ee4fe
Autor:
Medha Dhurandhar
Publikováno v:
Discrete Mathematics. 42:51-56
Brooks' Theorem says that if for a graph G,Δ(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 Kn+1 is a component of G. In this paper we prove that if a graph G has none of some three graphs (K1,3;K5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e1b26c2829b6babbbf58168d14b1a46
https://doi.org/10.1016/0012-365x(82)90052-8
https://doi.org/10.1016/0012-365x(82)90052-8