View source for K. R. Parthasarathy (graph theorist)

{{distinguish|K. R. Parthasarathy (probabilist)}}
{{Use dmy dates|date=November 2018}}
{{Use Indian English|date=November 2018}}
'''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 <ref name=mg>{{mathgenealogy|id=84221}}</ref> 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 graph]]s.<ref>{{citation
 | last1 = Parthasarathy | first1 = K. R.
 | last2 = Ravindra | first2 = G.
 | doi = 10.1016/s0095-8956(76)80005-6
 | issue = 3
 | journal = Journal of Combinatorial Theory
 | pages = 212–223
 | series = Series B
 | title = The strong perfect-graph conjecture is true for <math>K_{1,3}</math>-free graphs
 | volume = 21
 | year = 1976| doi-access = free
 }}; see review by [[László Lovász]], {{MR|0437377}}, and unsigned review, {{zbl|0297.05109}}</ref> Parthasarathy guided and refereed Ph.D. students in graph theory, among them [[S. A. Choudum]].<ref name=mg/> Parthasarathy wrote a book on graph theory, ''Basic Graph Theory'' (Tata McGraw-Hill, 1994).

==References==
{{reflist}}

{{authority control}}

{{DEFAULTSORT:Parthasarathy, K. R.}}
[[Category:Tamil scholars]]
[[Category:Graph theorists]]
[[Category:IIT Kharagpur alumni]]
[[Category:Academic staff of IIT Madras]]
[[Category:Living people]]
[[Category:Indian combinatorialists]]
[[Category:Year of birth missing (living people)]]


{{India-academic-bio-stub}}
{{mathematician-stub}}