>OAbot m Open access bot: doi added to citation with #oabot. |
->JJMC89 bot III m Moving Category:Indian Institute of Technology Madras faculty to Category:IIT Madras faculty per Wikipedia:Categories for discussion/Log/2021 April 22#Category:Indian Institute of Technology Madras alumni |
||
| Line 24: | Line 24: | ||
[[Category:Graph theorists]] | [[Category:Graph theorists]] | ||
[[Category:Indian Institute of Technology Kharagpur alumni]] | [[Category:Indian Institute of Technology Kharagpur alumni]] | ||
[[Category: | [[Category:IIT Madras faculty]] | ||
[[Category:Living people]] | [[Category:Living people]] | ||
[[Category:Indian combinatorialists]] | [[Category:Indian combinatorialists]] | ||
Latest revision as of 08:21, 5 May 2021
K. R. Parthasarathy is a professor emeritus of graph theory from the Department of Mathematics, Indian Institute of Technology Madras, Chennai. He received his Ph.D. (1966) in graph theory [1] from the Indian Institute of Technology Kharagpur. Parthasarathy is known for his work (with his student G. Ravindra) proving the special case of the strong perfect graph conjecture for claw-free graphs.[2] Parthasarathy guided and refereed Ph.D. students in graph theory, among them S. A. Choudum.[1] Parthasarathy wrote a book on graph theory, Basic Graph Theory (Tata McGraw-Hill, 1994).
References[edit | edit source]
- ↑ 1.0 1.1 K. R. Parthasarathy at the Mathematics Genealogy Project
- ↑ Parthasarathy, K. R.; Ravindra, G. (1976), "The strong perfect-graph conjecture is true for -free graphs", Journal of Combinatorial Theory, Series B, 21 (3): 212–223, doi:10.1016/s0095-8956(76)80005-6; see review by László Lovász, MR0437377, and unsigned review, Template:Zbl
 Error creating thumbnail: File missing  | This Indian academic-related biographical article is a stub. You can help Bharatpedia by expanding it. |
