
Search the dblp DataBase
Michael Plantholt:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Saad ElZanati, Michael Plantholt, Charles Vanden Eynden
Graph Decompositions into Generalized Cubes. [Citation Graph (0, 0)][DBLP] Ars Comb., 1998, v:49, n:, pp: [Journal]
 Michael Plantholt, Shailesh K. Tipnis
All Regular Multigraphs of Even Order and High Degree Are 1factorable. [Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp: [Journal]
 Larry Eggan, Michael Plantholt
The chromatic index of nearly bipartite multigraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1986, v:40, n:1, pp:7180 [Journal]
 Michael Plantholt
Overfull conjecture for graphs with high minimum degree. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:47, n:2, pp:7380 [Journal]
 Michael Plantholt
The chromatic index of graphs with large maximum degree. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:47, n:, pp:9196 [Journal]
 Michael Plantholt
A sublinear bound on the chromatic index of multigraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:202, n:13, pp:201213 [Journal]
 Michael Plantholt, Shailesh K. Tipnis
The chromatic index of multigraphs of order at most 10. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:177, n:13, pp:185193 [Journal]
 Michael Plantholt, Shailesh K. Tipnis
The chromatic index of multigraphs that are nearly full. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:82, n:2, pp:197207 [Journal]
On a wellspread halving of regular multigraphs. [Citation Graph (, )][DBLP]
Search in 0.045secs, Finished in 0.047secs
