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
Hilfe
Suche: Journal=Discrete Math. AND Volume=118
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of finite linear spaces on
v
points,
n^2 \le v < (n+1)^2
, and
b = n^2 + n+3
lines,
n \ge 10
Lynn Margaret Batten
Discrete Mathematics
118
(1-3), 1993, pp. 1-9
Graphs with every matching contained in a cycle
Abdelhamid Benhocine
,
A. Paweƚ Wojda
Discrete Mathematics
118
(1-3), 1993, pp. 11-21
Coloring a graph optimally with two colors
H.J. Broersma
,
F. Göbel
Discrete Mathematics
118
(1-3), 1993, pp. 23-31
Block-transitive
t
-designs I: Point-imprimitive designs
Peter J. Cameron
,
Cheryl E. Praeger
Discrete Mathematics
118
(1-3), 1993, pp. 33-43
The
3x + 1
problem: New lower bounds on nontrivial cycle lengths
Shalom Eliahou
Discrete Mathematics
118
(1-3), 1993, pp. 45-56
A neighborhood condition which implies the existence of a complete multipartite subgraph
Ralph J. Faudree
,
Debra J. Knisley
Discrete Mathematics
118
(1-3), 1993, pp. 57-68
Polychromatic Hamilton cycles
Alan Frieze
,
Bruce Reed
Discrete Mathematics
118
(1-3), 1993, pp. 69-74
Minimum-cardinality triangulations of the
d
-cube for
d = 5
and
d = 6
Robert B. Hughes
Discrete Mathematics
118
(1-3), 1993, pp. 75-118
On face vectors and vertex vectors of convex polyhedra
Stanislav Jendrol
Discrete Mathematics
118
(1-3), 1993, pp. 119-144
The total interval number of a graph, I: Fundamental classes
Thomas M. Kratzke
,
Douglas B. West
Discrete Mathematics
118
(1-3), 1993, pp. 145-156
Towards the critical problem: On the coalgebraic relation between sets and multisets
Daniel E. Loeb
Discrete Mathematics
118
(1-3), 1993, pp. 157-164
The harmonious chromatic number of a complete binary and trinary tree
Zhikang Lu
Discrete Mathematics
118
(1-3), 1993, pp. 165-172
Cycle indices and subgroup lattices
I. Morris
,
C.D. Wensley
Discrete Mathematics
118
(1-3), 1993, pp. 173-195
The equations
D^k Y = X^n
in combinatorial species
Dayanand S. Rajan
Discrete Mathematics
118
(1-3), 1993, pp. 197-206
Codes for perfectly correcting errors of lilmited size
Samira Saidi
Discrete Mathematics
118
(1-3), 1993, pp. 207-223
Graphs on which a dihedral group acts edge-transitively
Robin Sue Sanders
Discrete Mathematics
118
(1-3), 1993, pp. 225-232
Interval-regularity does not lead to interval motonicity
Michel Mollard
Discrete Mathematics
118
(1-3), 1993, pp. 233-237
An obvious proof of Fishburn's interval order theorem
Kenneth P. Bogart
Discrete Mathematics
118
(1-3), 1993, pp. 239-242
Congruence classes of matrices in
GL _2 (F _q)
Priscilla S. Bremser
Discrete Mathematics
118
(1-3), 1993, pp. 243-249
The existence of a simple
3-(28,5,30)
design
Yeow Meng Chee
Discrete Mathematics
118
(1-3), 1993, pp. 251-252
On a class of kernel-perfect and kernel-perfect-critical graphs
Kiran B. Chilakamarri
,
Peter Hamburger
Discrete Mathematics
118
(1-3), 1993, pp. 253-257
On isomorphic subgraphs
Ronald J. Gould
,
Vojtech Rödl
Discrete Mathematics
118
(1-3), 1993, pp. 259-262
Further results about large sets of disjoint Mendelsohn triple systems
Qingde Kang
,
Yanxun Chang
Discrete Mathematics
118
(1-3), 1993, pp. 263-268
On 3-colorings of
E(K _n)
Jeong Han Kim
Discrete Mathematics
118
(1-3), 1993, pp. 269-273
On the girth of infinite graphs
Norbert Seifter
Discrete Mathematics
118
(1-3), 1993, pp. 275-283
Seiten 1
2
>