Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Plantholt, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
Arthur H. Busch
,
Michael S. Jacobson
,
Timothy Morris
,
Michael J. Plantholt
,
Shailesh K. Tipnis
Graphs and Combinatorics
29
(3), 2013, pp. 359-364
A combined logarithmic bound on the chromatic index of multigraphs
Michael Plantholt
Journal of Graph Theory
73
(3), 2013, pp. 239-259
Overfull conjecture for graphs with high minimum degree
Michael Plantholt
Journal of Graph Theory
47
(2), 2004, pp. 73-80
Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
Frank Harary
,
Michael J. Plantholt
Journal of Graph Theory
13
(6), 1989, pp. 703-712
The chromatic index of nearly bipartite multigraphs
Larry Eggan
,
Michael Plantholt
Journal of Combinatorial Theory Series B
40
(1), 1986, February, pp. 71-80
The graph reconstruction number
Frank Harary
,
Michael Plantholt
Journal of Graph Theory
9
(4), 1985, pp. 451-454
A generalized construction of chromatic index critical graphs from bipartite graphs
Michael Plantholt
Journal of Graph Theory
9
(3), 1985, pp. 371-379