Skip to main content
Department of Mathematics

Professor Shailesh Tipnis

Professor
Mathematics
Office Phone
(309) 438-7707office
phone
Email
tipnis@ilstu.eduemail
  • Research

Journal Article

Tipnis, S., Diwan, A., Frye, J., & Plantholt, M. A sufficient degree condition for the existence of an anti-directed 2-factor in a directed graph. Discrete Mathematics 311 (2011): 2556-2562.
Tipnis, S., Busch, A., Jacobson, M., Morris, T., & Plantholt, M. Improved sufficient conditions for the existence of anti-directed hamiltonian cycles in digraphs. Graphs and Combinatorics (2011)
Tipnis, S., Badheka, K., & Plantholt, M. On a well-spread halving of directed multigraphs. Ars Combin. 100 (2011)
Tipnis, S., Jordon, H., & McBride, R. The Convex Hull of Degree Sequences of Signed Graphs. Discrete Mathematics 309 (2009): 5841-5848.
Tipnis, S., & Plantholt, M. Vertex-oriented Hamilton cycles in directed graphs. The Electronic Journal of Combinatorics 16 (2009)

Presentations

An approximation algorithm for a constrained forest problem. Discrete Mathematics group. Computer Science, Indian Institute of Technology. (2012)
A constrained forest problem. Discrete Mathematics seminar. (2011)
Anti-directed Hamilton cycles and 2-factors. 25th Midwestern Conference on Combinatorics, Cryptography, and Computing. (2011)
Regular multigraphs of high degree and even order are 1-factorable. Department of Computer Science. Indian Institute of Technology (IIT). (2010)
Directed and Anti-directed Hamilton cycles and 2 factors in digraphs. Discrete Math Group. (2009)
Improved sufficient conditions for the existence of anti-directed hamiltonian cycles in. Department of Computer Science. Indian Institute of Technology (IIT). (2009)