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=112
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The set of types of a finitely generated variety
Joel D. Berman
,
Emil W. Kiss
,
Péter Prŏle
,
Ágnes Szendrei
Discrete Mathematics
112
(1-3), 1993, pp. 1-20
On uniquely 3-colorable graphs
Chong-Yun Chao
,
Zhibo Chen
Discrete Mathematics
112
(1-3), 1993, pp. 21-27
Factors in graphs with odd-cycle property
Ciping Chen
,
Jianfang Wang
Discrete Mathematics
112
(1-3), 1993, pp. 29-40
Generating the Mathieu groups and associated Steiner systems
Marston Conder
Discrete Mathematics
112
(1-3), 1993, pp. 41-47
Paths in interval graphs and circular arc graphs
Peter Damaschke
Discrete Mathematics
112
(1-3), 1993, pp. 49-64
Enumeration of skew Ferrers diagrams
M.P. Delest
,
J.M. Fedou
Discrete Mathematics
112
(1-3), 1993, pp. 65-79
Disjoint circuits on a Klein bottle and a theorem on posets
Guoli Ding
Discrete Mathematics
112
(1-3), 1993, pp. 81-91
On non-Abelian group difference sets
Shuhong Gao
,
Wandi Wei
Discrete Mathematics
112
(1-3), 1993, pp. 93-102
Counting irreducible factors of polynomials over a finite field
Arnold Knopfmacher
,
John Knopfmacher
Discrete Mathematics
112
(1-3), 1993, pp. 103-118
Direct product decompositions of lattices, closures and relation schemes
Leonid Libkin
Discrete Mathematics
112
(1-3), 1993, pp. 119-138
Lower bound of cyclic edge connectivity for
n
-extendability of regular graphs
Dingjun Lou
,
D.A. Holton
Discrete Mathematics
112
(1-3), 1993, pp. 139-150
The size of the largest hole in a random graph
Tomasz Łuczak
Discrete Mathematics
112
(1-3), 1993, pp. 151-163
Nesting partial Steiner triple systems with 2-regular leave graphs
K.T. Phelps
,
C.A. Rodger
Discrete Mathematics
112
(1-3), 1993, pp. 165-172
The isolation game for regular graphs
A.G. Robinson
,
A.J. Goldman
Discrete Mathematics
112
(1-3), 1993, pp. 173-184
A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
J. Rodriguez
,
A. Satyanarayana
Discrete Mathematics
112
(1-3), 1993, pp. 185-197
Mutipartite Turán problem for connected graphs and hypergraphs
Zsolt Tuza
Discrete Mathematics
112
(1-3), 1993, pp. 199-206
Cover preserving embedding of modular lattices into partition lattices
Marcel Wild
Discrete Mathematics
112
(1-3), 1993, pp. 207-244
On the concatenated structures of a
[49, 18, 12]
binary abelian code
Hervé Chabanne
,
Nicolas Sendrier
Discrete Mathematics
112
(1-3), 1993, pp. 245-248
A new construction of circulant
GH (p ^2; \bf Z _p)
Bradley W. Brock
Discrete Mathematics
112
(1-3), 1993, pp. 249-252
Hamiltonian graphs involving neighborhood intersections
Guantao Chen
Discrete Mathematics
112
(1-3), 1993, pp. 253-257
Random edge domination
Peter Dolan
,
Mark Halsey
Discrete Mathematics
112
(1-3), 1993, pp. 259-260
On consecutive numbers of the same height in the Collatz problem
Guo-Gang Gao
Discrete Mathematics
112
(1-3), 1993, pp. 261-267
Distributive sublattices and weakly independent subsets in modular lattices
Zsolt Lengvárszky
Discrete Mathematics
112
(1-3), 1993, pp. 269-273
Antitwins in partitionable graphs
Frédéric Maffray
Discrete Mathematics
112
(1-3), 1993, pp. 275-278
7-critical graphs of bounded genus
Bojan Mohar
Discrete Mathematics
112
(1-3), 1993, pp. 279-281
Seiten 1
2
>