Misplaced Pages

K. R. Parthasarathy (graph theorist)

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
(Redirected from K. R. Parthasarathy (Graph theorist)) Not to be confused with K. R. Parthasarathy (probabilist).

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 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. Parthasarathy guided and refereed Ph.D. students in graph theory, among them S. A. Choudum. Parthasarathy wrote a book on graph theory, Basic Graph Theory (Tata McGraw-Hill, 1994).

References

  1. ^ K. R. Parthasarathy at the Mathematics Genealogy Project
  2. Parthasarathy, K. R.; Ravindra, G. (1976), "The strong perfect-graph conjecture is true for K 1 , 3 {\displaystyle K_{1,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, Zbl 0297.05109


Flag of IndiaScientist icon Stub icon

This Indian academic-related biographical article is a stub. You can help Misplaced Pages by expanding it.

Stub icon

This article about a mathematician is a stub. You can help Misplaced Pages by expanding it.

Categories:
K. R. Parthasarathy (graph theorist) Add topic