I agree that this site is using cookies. You can find further informations here.
X
Plantholt, Michael J.
32  results:
Search for persons X
?
1

Edge coloring graphs with large minimum degree:

Plantholt, Michael J. ; Shan, Songling
Journal of Graph Theory.  102 (2022)  4 - p. 611-632 , 2022
Link: https://doi.org/10.1002/..
 
?
2

The chromatic index of graphs with large even order n and m..:

Plantholt, Michael
Discrete Mathematics.  345 (2022)  7 - p. 112880 , 2022
Link: https://doi.org/10.1016/..
 
?
3

The complexity of $P$4-decomposition of regular graphs and ..:

Diwan, Ajit ; Dion, Justine ; Mendell, David..
Discrete Mathematics & Theoretical Computer Science.  17 no.2 (2015)  Graph Theory - p. , 2015
Link: https://doi.org/10.46298..
 
?
4

On decomposing even regular multigraphs into small isomorph..:

El-Zanati, Saad I. ; Plantholt, Michael J. ; Tipnis, Shailesh K.
Discrete Mathematics.  325 (2014)  - p. 47-51 , 2014
Link: https://doi.org/10.1016/..
 
?
5

A Combined Logarithmic Bound on the Chromatic Index of Mult..:

Plantholt*, Michael
Journal of Graph Theory.  73 (2012)  3 - p. 239-259 , 2012
Link: https://doi.org/10.1002/..
 
?
6

Improved Sufficient Conditions for the Existence of Anti-Di..:

Busch, Arthur H. ; Jacobson, Michael S. ; Morris, Timothy..
Graphs and Combinatorics.  29 (2011)  3 - p. 359-364 , 2011
Link: https://doi.org/10.1007/..
 
?
7

A sufficient condition for the existence of an anti-directe..:

Diwan, Ajit A. ; Frye, Josh B. ; Plantholt, Michael J..
Discrete Mathematics.  311 (2011)  21 - p. 2556-2562 , 2011
Link: https://doi.org/10.1016/..
 
?
8

Overfull conjecture for graphs with high minimum degree:

Plantholt, Michael
Journal of Graph Theory.  47 (2004)  2 - p. 73-80 , 2004
Link: https://doi.org/10.1002/..
 
?
9

A sublinear bound on the chromatic index of multigraphs:

Plantholt, Michael
Discrete Mathematics.  202 (1999)  1-3 - p. 201-213 , 1999
Link: https://doi.org/10.1016/..
 
?
10

The chromatic index of multigraphs of order at most 10:

Plantholt, Michael J. ; Tipnis, Shailesh K.
Discrete Mathematics.  177 (1997)  1-3 - p. 185-193 , 1997
Link: https://doi.org/10.1016/..
 
?
11

Regular Multigraphs of High Degree are 1-Factorizable:

Plantholt, Michael J. ; Tipnis, Shailesh K.
Journal of the London Mathematical Society.  s2-44 (1991)  3 - p. 393-400 , 1991
Link: https://doi.org/10.1112/..
 
?
12

The chromatic index of multigraphs that are nearly full:

Plantholt, Michael J. ; Tipnis, Shailesh K.
Discrete Mathematics.  82 (1990)  2 - p. 197-207 , 1990
Link: https://doi.org/10.1016/..
 
?
13

Classification of interpolation theorems for spanning trees..:

Harary, Frank ; Plantholt, Michael J.
Journal of Graph Theory.  13 (1989)  6 - p. 703-712 , 1989
Link: https://doi.org/10.1002/..
 
?
14

Modelling properties of spanning trees: Diameter and distan..:

Plantholt, Michael J.
Mathematical and Computer Modelling.  11 (1988)  - p. 218-221 , 1988
Link: https://doi.org/10.1016/..
 
?
15

The chromatic index of nearly bipartite multigraphs:

Eggan, Larry ; Plantholt, Michael
Journal of Combinatorial Theory, Series B.  40 (1986)  1 - p. 71-80 , 1986
Link: https://doi.org/10.1016/..
 
1-15