most citedA Combined Logarithmic Bound on the Chromatic Index of a Multigraph

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2021

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…

math.CO2010★ 1 cited

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…

math.CO2010

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…