Created by OAbot
Last edited May 5, 2021
Talk
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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

  1. ↑ 1.0 1.1 K. R. Parthasarathy at the Mathematics Genealogy Project
  2. ↑ Parthasarathy, K. R.; Ravindra, G. (1976), "The strong perfect-graph conjecture is true for K1,3-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


Page Module:Article stub box/styles.css has no content.