Ajit A Diwan

     B.Tech - IIT Bombay, 1983
    Ph.D - TIFR Bombay, 1989
    Faculty in IIT Bombay since 1988

Graph theory, Combinatorics, Algorithms

1. Decomposing graphs with girth at least 5 under degree constraints, J. Graph Theory, Vol. 33(4), April 2000.
2. Disconnected 2-factors in planar cubic bridgeless graphs, J. Combinatorial Theory, Ser B, Vol. 84(2), March 2002.
3. Plane triangulations are 6-partitionable (with Manish P. Kurhekar), Discrete Mathematics, Vol. 256(1), September 2002.
4. Degree condition for vertex-disjoint paths
5. On 2-factors in powers of connected graphs (with Narendra Agarwal)
6. Triangle-factors in powers of graphs (with Narendra Agarwal), presented at R. C. Bose Centenary Symposium, I.S.I, Dec 2002, Electronic Notes in Discrete Mathematics, Vol. 15
   
7. Partitioning 2-connected graphs into connected subgraphs
8. Coloured matchings in edge-coloured graphs (with Ch. Sobhan Babu)
9. Red-Blue cliques in edge-coloured graphs
10. A generalization of Mader's theorem
11. Edge-disjoint paths with three terminals (with Namrata Tholiya)
12. Non-separating trees in connected graphs(with Namrata Tholiya, revised version appears in Discrete Mathematics)
13. Cycles of even lengths modulo k (revised version appears in Journal of Graph Theory)
14. Balanced group-labeled graphs (with Manas Joglekar, Nisarg Shah)(revised version appears in Discrete Math.)
    Preliminary version presented at ICRTGC, Cochin 2010. Slides
    
15. P_3-decomposition of Directed Graphs
16. Decomposing semi-complete multigraphs and directed graphs into paths of length two
17. Subdivisions of maximal 3-degenerate graphs of order d+1 in graphs of minimum degree d (revised version appears in Journal of Graph Theory).
18. Explicit Δ-edge-coloring of consecutive levels in a divisor lattice(revised version appears in Discrete Mathematics).
19. Another simple reformulation of the four color theorem (a presentation based on this)
20. Chords of 2-factors in planar cubic bridgeless graphs (revised version appears in Graphs and Combinatorics).
21. Clique factors in powers of graphs (with Aniruddha Joshi).
22. Colouring planar graphs with a precoloured induced cycle.
23. Cycles of weight divisible by $k$

Design and Analysis of Algorithms
Algorithms and Complexity
Discrete Structures
Combinatorics
Applied Algorithms
Data Structures and Algorithms
Operations Research

1. Subdivisions of Graphs (Namrata Tholiya)
2. 2-factors in powers of connected graphs (Narendra Agarwal)
3. Partitioning a Graph into connected parts (Manish Kurhekar)
4. Separating Matchings (Trivikram Nayak and Sobhan Babu)
5. Minimum Level Graph Drawings (C.J.Cibu)

1. Upward Planar Drawings of Graphs (M. Chandramouli)
2. Locally connected Planar Graphs (N. Usharani)
3. Degree Conditions for Subgraphs (Ch. Sobhan Babu)