Michael Plantholt

Publication Activity (10 Years)

Years Active: 1983-2022
Publications (10 Years): 1

Top Topics

Structural Learning

Top Venues

Discret. Math. Theor. Comput. Sci.

Discuss. Math. Graph Theory

Publications

Michael Plantholt
/3. Discret. Math. 345 (7) (2022)
Saad I. El-Zanati, Marie Ermete, James Hasty, Michael Plantholt, Shailesh K. Tipnis
On decomposing regular graphs into isomorphic double-stars. Discuss. Math. Graph Theory 35 (1) (2015)
Ajit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis
-decomposition of regular graphs and multigraphs. Discret. Math. Theor. Comput. Sci. 17 (2) (2015)
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
On decomposing even regular multigraphs into small isomorphic trees. Discret. Math. 325 (2014)
Arthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis
Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs. Graphs Comb. 29 (3) (2013)
Michael Plantholt
A Combined Logarithmic Bound on the Chromatic Index of Multigraphs. J. Graph Theory 73 (3) (2013)
Ajit A. Diwan, Josh B. Frye, Michael Plantholt, Shailesh K. Tipnis
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph. Discret. Math. 311 (21) (2011)
Shailesh K. Tipnis, Michael Plantholt, Kaushal N. Badheka
On a well-spread halving of directed multigraphs. Ars Comb. 100 (2011)
Michael Plantholt, Shailesh K. Tipnis
Vertex-Oriented Hamilton Cycles in Directed Graphs. Electron. J. Comb. 16 (1) (2009)
Shailesh K. Tipnis, Michael Plantholt
On a well-spread halving of regular multigraphs. Ars Comb. 83 (2007)
Michael Plantholt
Overfull conjecture for graphs with high minimum degree. J. Graph Theory 47 (2) (2004)
Michael Plantholt, Shailesh K. Tipnis
All Regular Multigraphs of Even Order and High Degree Are 1-factorable. Electron. J. Comb. 8 (1) (2001)
Michael Plantholt, Shailesh K. Tipnis
On the list chromatic index of nearly bipartite multigraphs. Australas. J Comb. 19 (1999)
Michael Plantholt
A sublinear bound on the chromatic index of multigraphs. Discret. Math. 202 (1-3) (1999)
Saad I. El-Zanati, Michael Plantholt, Charles Vanden Eynden
Graph Decompositions into Generalized Cubes. Ars Comb. 49 (1998)
Michael Plantholt, Shailesh K. Tipnis
The chromatic index of multigraphs of order at most 10. Discret. Math. 177 (1-3) (1997)
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
Extensions of some factorization results from simple graphs to multigraphs. J. Graph Theory 24 (4) (1997)
Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis
Factorization of regular multigraphs into regular graphs. J. Graph Theory 19 (1) (1995)
Michael Plantholt, Shailesh K. Tipnis
The chromatic index of multigraphs that are nearly full. Discret. Math. 82 (2) (1990)
Frank Harary, Michael Plantholt
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. J. Graph Theory 13 (6) (1989)
Larry Eggan, Michael Plantholt
The chromatic index of nearly bipartite multigraphs. J. Comb. Theory, Ser. B 40 (1) (1986)
Frank Harary, Michael Plantholt
The graph reconstruction number. J. Graph Theory 9 (4) (1985)
Michael Plantholt
A generalized construction of chromatic index critical graphs from bipartite graphs. J. Graph Theory 9 (3) (1985)
Michael Plantholt
The chromatic index of graphs with large maximum degree. Discret. Math. 47 (1983)