Michael Plantholt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2024

On f-derangements and decomposing bipartite graphs into pathsMichael Plantholt, Hamidreza Habibi, Benjamin Mussell. adam, 7(3):3, 2024. [doi]

2022

n/3Michael Plantholt. DM, 345(7):112880, 2022. [doi]

2015

4-decomposition of regular graphs and multigraphsAjit A. Diwan, Justine E. Dion, David J. Mendell, Michael Plantholt, Shailesh K. Tipnis. dmtcs, 17(2):63-76, 2015. [doi]

On decomposing regular graphs into isomorphic double-starsSaad El-Zanati, Marie Ermete, James Hasty, Michael Plantholt, Shailesh K. Tipnis. dmgt, 35(1):73-79, 2015. [doi]

2014

On decomposing even regular multigraphs into small isomorphic treesSaad El-Zanati, Michael Plantholt, Shailesh K. Tipnis. DM, 325:47-51, 2014. [doi]

2013

Improved Sufficient Conditions for the Existence of Anti-Directed Hamiltonian Cycles in DigraphsArthur H. Busch, Michael S. Jacobson, Timothy Morris, Michael Plantholt, Shailesh K. Tipnis. gc, 29(3):359-364, 2013. [doi]

A Combined Logarithmic Bound on the Chromatic Index of MultigraphsMichael Plantholt. jgt, 73(3):239-259, 2013. [doi]

2011

A sufficient condition for the existence of an anti-directed 2-factor in a directed graphAjit A. Diwan, Josh B. Frye, Michael Plantholt, Shailesh K. Tipnis. DM, 311(21):2556-2562, 2011. [doi]

On a well-spread halving of directed multigraphsShailesh K. Tipnis, Michael Plantholt, Kaushal N. Badheka. arscom, 100:485-491, 2011.

2009

Vertex-Oriented Hamilton Cycles in Directed GraphsMichael Plantholt, Shailesh K. Tipnis. combinatorics, 16(1), 2009. [doi]

2007

On a well-spread halving of regular multigraphsShailesh K. Tipnis, Michael Plantholt. arscom, 83, 2007.

2004

Overfull conjecture for graphs with high minimum degreeMichael Plantholt. jgt, 47(2):73-80, 2004. [doi]

2001

All Regular Multigraphs of Even Order and High Degree Are 1-factorableMichael Plantholt, Shailesh K. Tipnis. combinatorics, 8(1), 2001. [doi]

1999

On the list chromatic index of nearly bipartite multigraphsMichael Plantholt, Shailesh K. Tipnis. ajc, 19:157-170, 1999. [doi]

A sublinear bound on the chromatic index of multigraphsMichael Plantholt. DM, 202(1-3):201-213, 1999. [doi]

1998

Graph Decompositions into Generalized CubesSaad El-Zanati, Michael Plantholt, Charles Vanden Eynden. arscom, 49, 1998.

1997

Extensions of some factorization results from simple graphs to multigraphsSaad El-Zanati, Michael Plantholt, Shailesh K. Tipnis. jgt, 24(4):291-295, 1997. [doi]

The chromatic index of multigraphs of order at most 10Michael Plantholt, Shailesh K. Tipnis. DM, 177(1-3):185-193, 1997. [doi]

1995

Factorization of regular multigraphs into regular graphsSaad El-Zanati, Michael Plantholt, Shailesh K. Tipnis. jgt, 19(1):93-105, 1995. [doi]

1990

The chromatic index of multigraphs that are nearly fullMichael Plantholt, Shailesh K. Tipnis. DM, 82(2):197-207, 1990. [doi]

1989

Classification of interpolation theorems for spanning trees and other families of spanning subgraphsFrank Harary, Michael Plantholt. jgt, 13(6):703-712, 1989. [doi]

1986

The chromatic index of nearly bipartite multigraphsLarry Eggan, Michael Plantholt. JCT, 40(1):71-80, 1986. [doi]

1985

The graph reconstruction numberFrank Harary, Michael Plantholt. jgt, 9(4):451-454, 1985. [doi]

A generalized construction of chromatic index critical graphs from bipartite graphsMichael Plantholt. jgt, 9(3):371-379, 1985. [doi]

1983

The chromatic index of graphs with large maximum degreeMichael Plantholt. DM, 47:91-96, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL