1 citations · 2 across the 5 of their papers we have counts for
5 papers
On the Multigraph Overfull Conjecture
Michael J. Plantholt, Songling Shan
A subgraph of a multigraph is overfull if . Analogous to the Overfull Conjecture proposed by Chetwynd and Hilton in 1986, Stiebitz…
On f-Derangements and Decomposing Bipartite Graphs into Paths
Michael Plantholt, Hamidreza Habibi, Benjamin Mussell
Let be a function (not necessarily one-to-one). An is a permutation such that…
Edge coloring graphs with large minimum degree
Michael J. Plantholt, Songling Shan
Let be a simple graph with maximum degree . A subgraph of is overfull if . Chetwynd and Hilton in 1985 conjectured that a gra…
A Combined Logarithmic Bound on the Chromatic Index of a Multigraph
Michael Plantholt
For a multigraph G, the integer round-up phi(G) of the fractional chromatic index yields a good general lower bound for the chromatic index . For an upper bound, Kahn showed that f…
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
Ajit A. Diwan, Josh B. Frye, Michael J. Plantholt +1
Let D be a directed graph with vertex set V and order n. An anti-directed hamiltonian cycle H in D is a hamiltonian cycle in the graph underlying D such that no pair of consecutive…