The chromatic index of graphs with a spanning star. - Mike Plantholt (J. Graph Theory, 1981)

The chromatic index of graphs with large maximum degree. - Michael Plantholt (Discret. Math., 1983)

The graph reconstruction number. - Frank Harary; Michael Plantholt (J. Graph Theory, 1985)

A generalized construction of chromatic index critical graphs from bipartite graphs. - Michael Plantholt (J. Graph Theory, 1985)

The chromatic index of nearly bipartite multigraphs. - Larry Eggan; Michael Plantholt (J. Comb. Theory B, 1986)

Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. - Frank Harary; Michael Plantholt (J. Graph Theory, 1989)

The chromatic index of multigraphs that are nearly full. - Michael Plantholt; Shailesh K. Tipnis (Discret. Math., 1990)

Factorization of regular multigraphs into regular graphs. - Saad I. El-Zanati; Michael Plantholt; Shailesh K. Tipnis (J. Graph Theory, 1995)

The chromatic index of multigraphs of order at most 10. - Michael Plantholt; Shailesh K. Tipnis (Discret. Math., 1997)

Extensions of some factorization results from simple graphs to multigraphs. - Saad I. El-Zanati; Michael Plantholt; Shailesh K. Tipnis (J. Graph Theory, 1997)

Graph Decompositions into Generalized Cubes. - Saad I. El-Zanati; Michael Plantholt; Charles Vanden Eynden (Ars Comb., 1998)

On the list chromatic index of nearly bipartite multigraphs. - Michael Plantholt; Shailesh K. Tipnis (Australas. J Comb., 1999)

A sublinear bound on the chromatic index of multigraphs. - Michael Plantholt (Discret. Math., 1999)

All Regular Multigraphs of Even Order and High Degree Are 1-factorable. - Michael Plantholt; Shailesh K. Tipnis (Electron. J. Comb., 2001)

Overfull conjecture for graphs with high minimum degree. - Michael Plantholt (J. Graph Theory, 2004)

On a well-spread halving of regular multigraphs. - Shailesh K. Tipnis; Michael Plantholt (Ars Comb., 2007)

Vertex-Oriented Hamilton Cycles in Directed Graphs. - Michael Plantholt; Shailesh K. Tipnis (Electron. J. Comb., 2009)

On a well-spread halving of directed multigraphs. - Shailesh K. Tipnis; Michael Plantholt; Kaushal N. Badheka (Ars Comb., 2011)

A sufficient condition for the existence of an anti-directed 2-factor in a directed graph. - Ajit A. Diwan; Josh B. Frye; Michael Plantholt; Shailesh K. Tipnis (Discret. Math., 2011)

Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in Digraphs. - Arthur H. Busch; Michael S. Jacobson; Timothy Morris; Michael Plantholt; Shailesh K. Tipnis (Graphs Comb., 2013)

A Combined Logarithmic Bound on the Chromatic Index of Multigraphs. - Michael Plantholt (J. Graph Theory, 2013)

On decomposing even regular multigraphs into small isomorphic trees. - Saad I. El-Zanati; Michael Plantholt; Shailesh K. Tipnis (Discret. Math., 2014)

On decomposing regular graphs into isomorphic double-stars. - Saad I. El-Zanati; Marie Ermete; James Hasty; Michael Plantholt; Shailesh K. Tipnis (Discuss. Math. Graph Theory, 2015)

The complexity of P4-decomposition of regular graphs and multigraphs. - Ajit A. Diwan; Justine E. Dion; David J. Mendell; Michael Plantholt; Shailesh K. Tipnis (Discret. Math. Theor. Comput. Sci., 2015)

The chromatic index of graphs with large even order n and minimum degree at least 2n/3. - Michael Plantholt (Discret. Math., 2022)

Edge coloring graphs with large minimum degree. - Michael J. Plantholt; Songling Shan (J. Graph Theory, 2023)

On f-derangements and decomposing bipartite graphs into paths. - Michael Plantholt; Hamidreza Habibi; Benjamin Mussell (Art Discret. Appl. Math., 2024)