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
[1]
Hilfe
Suche: Author="Hoffman, D.G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hall's theorem and extending partial Latinized rectangles
J.L. Goldwasser
,
A.J.W. Hilton
,
D.G. Hoffman
,
Sibel Özkan
Journal of Combinatorial Theory Series A
130
, 2015, pp. 26-41
Almost resolvable maximum packings of complete graphs with 4-cycles
Elizabeth J. Billington
,
Italo J. Dejter
,
D.G. Hoffman
,
C.C. Lindner
Graphs and Combinatorics
27
(2), 2011, pp. 161-170
The generalized almost resolvable cycle system problem
Peter Adams
,
Elizabeth J. Billington
,
D.G. Hoffman
,
C.C. Lindner
Combinatorica
30
(6), 2010, pp. 617-625
Trades and graphs
Elizabeth J. Billington
,
D.G. Hoffman
Graphs and Combinatorics
17
(1), 2001, pp. 39-54
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
M.M. Cropper
,
J.L. Goldwasser
,
A.J.W. Hilton
,
D.G. Hoffman
,
P.D., Jr. Johnson
Journal of Graph Theory
33
(4), 2000, pp. 199-219
Cores of class II graphs
D.G. Hoffman
Journal of Graph Theory
20
(3), 1995, pp. 397-402
A note on a conjecture concerning symmetric resilient functions
K. Gopalakrishnan
,
D.G. Hoffman
,
D.R. Stinson
Information Processing Letters
47
(3), 1993, pp. 139-143
Maximal sets of 2-factors and Hamiltonian cycles
D.G. Hoffman
,
C.A. Rodger
,
A. Rosa
Journal of Combinatorial Theory Series B
57
(1), 1993, pp. 69-76
Directed star decompositions of the complete directed graph
Charles J. Colbourn
,
D.G. Hoffman
,
C.A. Rodger
Journal of Graph Theory
16
(5), 1992, pp. 517-528
The chromatic index of complete multipartite graphs
D.G. Hoffman
,
C.A. Rodger
Journal of Graph Theory
16
(2), 1992, pp. 159-163
On the
\Delta
-subgraph of graphs which are critical with respect to the chromatic index
A.G. Chetwynd
,
A.J.W. Hilton
,
D.G. Hoffman
Journal of Combinatorial Theory Series B
46
, 1989, pp. 240-245
On the construction of odd cycle systems
D.G. Hoffman
,
C.C. Lindner
,
C.A. Rodger
Journal of Graph Theory
13
(4), 1989, pp. 417-426
Impossibility of decomposing the complete graph on
n
points into
n - 1
isomorphic complete bipartite graphs
D. de Caen
,
D.G. Hoffman
SIAM Journal on Discrete Mathematics
2
, 1989, pp. 48-50
Class one graphs
D.G. Hoffman
,
C.A. Rodger
Journal of Combinatorial Theory Series B
44
(3), 1988, June, pp. 372-376
Bidegreed graphs are edge reconstructible
W.J. Myrvold
,
M.N. Ellingham
,
D.G. Hoffman
Journal of Graph Theory
11
(3), 1987, pp. 281-302
On the spectrum of
n
quasigroups with given conjugate invariant subgroup
D.G. Hoffman
Journal of Combinatorial Theory Series A
35
, 1983, pp. 98-99
On a probabilistic method in graph theory
D.L. Greenwell
,
D.G. Hoffman
Journal of Combinatorial Theory Series B
31
(3), 1981, December, pp. 344-347