We stand with Ukraine  

Shreedhara Prasada Mohanty

Affiliations:
  • Indian Institute of Technology, Department of Mathematics, Kanpur, India
  • University of California, Los Angeles, USA (PhD 1971)


According to our database1, Shreedhara Prasada Mohanty authored at least 4 papers between 1980 and 1995.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1995
Intersection graphs of vertex disjoint paths in a tree.
[BibTeX]
[DOI]
B. S. Panda
,
Shreedhara Prasada Mohanty
Discret. Math., 1995

1994
Recognition Algorithm for Intersection Graphs of Edge Disjoint Paths in a Tree.
[BibTeX]
[DOI]
B. S. Panda
,
Shreedhara Prasada Mohanty
Inf. Process. Lett., 1994

1981
Which rational numbers are binding numbers?
[BibTeX]
[DOI]
Vinay G. Kane
,
Shreedhara Prasada Mohanty
,
Ernst G. Straus
J. Graph Theory, 1981

1980
Shortest string containing all permutations.
[BibTeX]
[DOI]
Shreedhara Prasada Mohanty
Discret. Math., 1980


  Loading...