Shailesh K. Tipnis

According to our database1, Shailesh K. Tipnis authored at least 18 papers between 1989 and 2015.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
The complexity of P<sub>4</sub>-decomposition of regular graphs and multigraphs.
Discret. Math. Theor. Comput. Sci., 2015

On decomposing regular graphs into isomorphic double-stars.
Discuss. Math. Graph Theory, 2015

2014
On decomposing even regular multigraphs into small isomorphic trees.
Discret. Math., 2014

2013
Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs.
Graphs Comb., 2013

2011
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph.
Discret. Math., 2011

On a well-spread halving of directed multigraphs.
Ars Comb., 2011

2009
The convex hull of degree sequences of signed graphs.
Discret. Math., 2009

Vertex-Oriented Hamilton Cycles in Directed Graphs.
Electron. J. Comb., 2009

2007
On a well-spread halving of regular multigraphs.
Ars Comb., 2007

2002
A generalization of the Oberwolfach problem.
J. Graph Theory, 2002

2001
All Regular Multigraphs of Even Order and High Degree Are 1-factorable.
Electron. J. Comb., 2001

1999
On the list chromatic index of nearly bipartite multigraphs.
Australas. J Comb., 1999

1997
Extensions of some factorization results from simple graphs to multigraphs.
J. Graph Theory, 1997

The chromatic index of multigraphs of order at most 10.
Discret. Math., 1997

1995
Factorization of regular multigraphs into regular graphs.
J. Graph Theory, 1995

1990
The chromatic index of multigraphs that are nearly full.
Discret. Math., 1990

1989
Node-Packing Problems with Integer Rounding Properties.
SIAM J. Discret. Math., 1989

A generalization of Robacker's theorem.
Discret. Math., 1989


  Loading...