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=117
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The automorphism group of generalized Reed-Muller codes
Thierry Berger
,
Pascale Charpin
Discrete Mathematics
117
(1-3), 1993, pp. 1-17
Spectra, Euclidean representations and clusterings of hypergraphs
Marianna Bolla
Discrete Mathematics
117
(1-3), 1993, pp. 19-39
Composed products and module polynomials over finite fields
Joel V. Brawley
,
David Brown
Discrete Mathematics
117
(1-3), 1993, pp. 41-56
Spanning closed trails in graphs
Zhi-Hong Chen
Discrete Mathematics
117
(1-3), 1993, pp. 57-71
Stable sets versus independent sets
Guoli Ding
Discrete Mathematics
117
(1-3), 1993, pp. 73-87
Cordes, arbres et permutations
Serge Dulucq
,
Jean-Guy Penaud
Discrete Mathematics
117
(1-3), 1993, pp. 89-105
Packing lines in a hypercube
Alexander Felzenbaum
,
Ron Holzman
,
Daniel J. Kleitman
Discrete Mathematics
117
(1-3), 1993, pp. 107-112
Cut-sets in infinite graphs and partial orders
A. Hajnal
,
N. Sauer
Discrete Mathematics
117
(1-3), 1993, pp. 113-125
The total chromatic number of graphs having large maximum degree
A.J.W. Hilton
,
H.R. Hind
Discrete Mathematics
117
(1-3), 1993, pp. 127-140
Universal cycles of
k
-subsets and
k
-permutations
B.W. Jackson
Discrete Mathematics
117
(1-3), 1993, pp. 141-150
A partial
m = (2k + 1)
-cycle system of order
n
can be embedded in an
m
-cycle system of order
(2n + 1)m
C.C. Lindner
,
C.A. Rodger
Discrete Mathematics
117
(1-3), 1993, pp. 151-159
A decomposition of locally finite graphs
Bogdan Oporowski
Discrete Mathematics
117
(1-3), 1993, pp. 161-168
Flag-transitive
C _3
-geometries
Antonio Pasini
Discrete Mathematics
117
(1-3), 1993, pp. 169-182
Packings and perfect path double covers of maximal planar graphs
Karen Seyffarth
Discrete Mathematics
117
(1-3), 1993, pp. 183-195
On biclique partitions of the complete graph
Bryan L. Shader
Discrete Mathematics
117
(1-3), 1993, pp. 197-213
Minimizing the number of tardy jobs in single machine sequencing
Ahmad H. Sharary
,
Nejib Zaguia
Discrete Mathematics
117
(1-3), 1993, pp. 215-223
The cordality of one-point union of
n
copies of a graph
Sze-Chin Shee
,
Yong-Song Ho
Discrete Mathematics
117
(1-3), 1993, pp. 225-243
Counterexamples to three conjectures concerning perfect graphs
Stefan Hougardy
Discrete Mathematics
117
(1-3), 1993, pp. 245-251
A triangulation of the 6-cube with 308 simplices
Robert B. Hughes
,
Michael R. Anderson
Discrete Mathematics
117
(1-3), 1993, pp. 253-256
A polynomial time circle packing algorithm
Bojan Mohar
Discrete Mathematics
117
(1-3), 1993, pp. 257-263
On the strong path partition conjecture of Berge
S. Sridharan
Discrete Mathematics
117
(1-3), 1993, pp. 265-270
On complete regularity of extended codes
A.E. Brouwer
Discrete Mathematics
117
(1-3), 1993, pp. 271-273
A spanning tree of the
2 ^m
-dimensional hypercube with maximum number of degree-preserving vertices
Sul-young Choi
,
Puhua Guan
Discrete Mathematics
117
(1-3), 1993, pp. 275-277
On MDS elliptic codes
Carlos Munuera
Discrete Mathematics
117
(1-3), 1993, pp. 279-286
Partition of a bipartite graph into cycles
Hong Wang
Discrete Mathematics
117
(1-3), 1993, pp. 287-291
Seiten 1
2
>