Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Diwan, Ajit A - Department of Computer Science and Engineering, Indian Institute of Technology Bombay
Edge-disjoint paths with three terminals Ajit A. Diwan and Namrata P. Tholiya
Non-separating Trees in Connected Graphs Ajit A. Diwan and Namrata P. Tholiya
Triangle-factors in powers of graphs Narendra Agarwal
Partitioning 2-connected graphs into connected subgraphs.
Degree condition for vertex-disjoint paths. Ajit A. Diwan
Introduction Balanced Group Labeled Graphs
RedBlue cliques in edgecoloured graphs Ajit A. Diwan
Coloured matchings in edgecoloured graphs Ajit Diwan and Ch. Sobhan Babu
Cycles of even lengths modulo k Ajit A. Diwan
On 2-factors in powers of connected graphs Narendra Agarwal
A generalization of Mader's theorem Ajit A. Diwan
