Michael Plantholt

25 papers Journal 25
YearRankTypeTitle / Venue / Authors
2024 J jnl
On f-derangements and decomposing bipartite graphs into paths.
Art Discret. Appl. Math.
Michael Plantholt, Hamidreza Habibi, Benjamin Mussell
2022 J jnl
The chromatic index of graphs with large even order
Discret. Math.
Michael Plantholt
2015 J jnl
On decomposing regular graphs into isomorphic double-stars.
Discuss. Math. Graph Theory
Saad I. El-Zanati, Marie Ermete, James Hasty, Michael Plantholt, Shailesh K. Tipnis
2015 J jnl
The complexity of P
Discret. Math. Theor. Comput. Sci.
Ajit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis
2014 J jnl
On decomposing even regular multigraphs into small isomorphic trees.
Discret. Math.
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
2013 J jnl
A Combined Logarithmic Bound on the Chromatic Index of Multigraphs.
J. Graph Theory
Michael Plantholt
2013 J jnl
Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs.
Graphs Comb.
Arthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis
2011 J jnl
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph.
Discret. Math.
Ajit A. Diwan, Josh B. Frye, Michael Plantholt, Shailesh K. Tipnis
2011 J jnl
On a well-spread halving of directed multigraphs.
Ars Comb.
Shailesh K. Tipnis, Michael Plantholt, Kaushal N. Badheka
2009 J jnl
Vertex-Oriented Hamilton Cycles in Directed Graphs.
Electron. J. Comb.
Michael Plantholt, Shailesh K. Tipnis
2007 J jnl
On a well-spread halving of regular multigraphs.
Ars Comb.
Shailesh K. Tipnis, Michael Plantholt
2004 J jnl
Overfull conjecture for graphs with high minimum degree.
J. Graph Theory
Michael Plantholt
2001 J jnl
All Regular Multigraphs of Even Order and High Degree Are 1-factorable.
Electron. J. Comb.
Michael Plantholt, Shailesh K. Tipnis
1999 J jnl
A sublinear bound on the chromatic index of multigraphs.
Discret. Math.
Michael Plantholt
1999 J jnl
On the list chromatic index of nearly bipartite multigraphs.
Australas. J Comb.
Michael Plantholt, Shailesh K. Tipnis
1998 J jnl
Graph Decompositions into Generalized Cubes.
Ars Comb.
Saad I. El-Zanati, Michael Plantholt, Charles Vanden Eynden
1997 J jnl
Extensions of some factorization results from simple graphs to multigraphs.
J. Graph Theory
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
1997 J jnl
The chromatic index of multigraphs of order at most 10.
Discret. Math.
Michael Plantholt, Shailesh K. Tipnis
1995 J jnl
Factorization of regular multigraphs into regular graphs.
J. Graph Theory
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
1990 J jnl
The chromatic index of multigraphs that are nearly full.
Discret. Math.
Michael Plantholt, Shailesh K. Tipnis
1989 J jnl
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs.
J. Graph Theory
Frank Harary, Michael Plantholt
1986 J jnl
The chromatic index of nearly bipartite multigraphs.
J. Comb. Theory B
Larry Eggan, Michael Plantholt
1985 J jnl
A generalized construction of chromatic index critical graphs from bipartite graphs.
J. Graph Theory
Michael Plantholt
1985 J jnl
The graph reconstruction number.
J. Graph Theory
Frank Harary, Michael Plantholt
1983 J jnl
The chromatic index of graphs with large maximum degree.
Discret. Math.
Michael Plantholt