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=Graphs and Combinatorics AND YEAR=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On set systems not containing delta systems
H.L. Abbott
,
Geoffrey Exoo
Graphs and Combinatorics
8
, 1992, pp. 1-9
Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality
Ron Aharoni
,
Ron Holzman
Graphs and Combinatorics
8
, 1992, pp. 11-22
Generalized sum graphs
Noga Alon
,
Edward R. Scheinerman
Graphs and Combinatorics
8
, 1992, pp. 23-29
Edge orbits and edge-deleted subgraphs
Lars Dvling Andersen
,
Songkang Ding
,
Gert Sabidussi
,
Preben Dahl Vestergaard
Graphs and Combinatorics
8
, 1992, pp. 31-44
Three-regular path pairable graphs
Ralph J. Faudree
,
András Gyárfás
,
Jenö Lehel
Graphs and Combinatorics
8
, 1992, pp. 45-52
On the
G
-matrices with entries and eigenvalues in
Q(i)
Xiang-dong Hou
Graphs and Combinatorics
8
, 1992, pp. 53-64
Partitions of bi-partite numbers into at most
j
parts
Bruce M. Landman
,
Ezra A. Brown
,
Frederick J. Portier
Graphs and Combinatorics
8
, 1992, pp. 65-73
On Hajnal's triangle-free game
Ákoss Seress
Graphs and Combinatorics
8
, 1992, pp. 75-79
Research problems - Spanning subgraphs of Random graphs
Noga Alon
,
Zoltán Füredi
Graphs and Combinatorics
8
, 1992, pp. 91-94
Almost
H
-factors in dense graphs
Noga Alon
,
Raphael Yuster
Graphs and Combinatorics
8
, 1992, pp. 95-102
Perfectly orderable graphs and almost all perfect graphs are kernel
M
-solvable
Mostafa Blidia
,
Konrad Engel
Graphs and Combinatorics
8
, 1992, pp. 103-108
Triangle-free subgraphs of powers of cycles
J.A. Bondy
,
S.C. Locke
Graphs and Combinatorics
8
, 1992, pp. 109-118
Total colorings of graphs of order
2n
having maximum degree
2n-2
Bor-Liang Chen
,
Hung-Lin Fu
Graphs and Combinatorics
8
, 1992, pp. 119-123
The cut cone III: On the role of triangle facets
Michel Deza
,
Monique Laurent
,
Svatopluk Poljak
Graphs and Combinatorics
8
, 1992, pp. 125-142
Nearly triply regular Drad's of
RH
type
Noboru Ito
,
Blessilda P. Raposa
Graphs and Combinatorics
8
, 1992, pp. 143-153
On inverse problems for the cycle graph operator
Van Bang Le
,
Erich Prisner
Graphs and Combinatorics
8
, 1992, pp. 155-164
Large regular graphs with no induced
2K_2
Madeleine Paoli
,
G.W. Peck
,
W.T., Jr. Trotter
,
Douglas B. West
Graphs and Combinatorics
8
, 1992, pp. 165-197
Research problems - Asymptotic solution of the Turán problem for some hypergraphs
Alexander Sidorenko
Graphs and Combinatorics
8
, 1992, pp. 199-201
Automorphism groups of graphs with forbidden subgraphs
Gerhard Behrendt
Graphs and Combinatorics
8
, 1992, pp. 203-206
Designs with block-size 6 in projective planes of characteristic 2
Jürgen Bierbrauer
Graphs and Combinatorics
8
, 1992, pp. 207-224
Smallest maximally Nonhamiltonian graphs II
L.H. Clark
,
R.C. Entringer
,
H.D. Shapiro
Graphs and Combinatorics
8
, 1992, pp. 225-231
Graphs with polynomial growth are covering graphs
C.D. Godsil
,
N. Seifter
Graphs and Combinatorics
8
, 1992, pp. 233-241
The asymptotic distribution of leaf heights in binary trees
W. Gutjahr
,
G.C. Pflug
Graphs and Combinatorics
8
, 1992, pp. 243-251
Counterexamples to a conjecture of Mader about cycles through specified vertices in
n
-edge-connected graphs
Andreas Huck
,
Haruko Okamura
Graphs and Combinatorics
8
, 1992, pp. 253-258
Reconstructing graphs as subsumed graphs of hypergrpahs, and some self-complementary triple systems
William Kocay
Graphs and Combinatorics
8
, 1992, pp. 259-276
Seiten 1
2
>