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=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ramsey graphs contain many distinct induced subgraphs
N. Alon
,
A. Hajnal
Graphs and Combinatorics
7
, 1991, pp. 1-6
Polynomial isomorphisms of combinatorial objects
Neal Brand
Graphs and Combinatorics
7
, 1991, pp. 7-14
Contractible edges in
n
-connected graphs with minimum degree greater than or equal to
[5n/4]
Yoshimi Egawa
Graphs and Combinatorics
7
, 1991, pp. 15-21
Shadows and shifting
P. Frankl
Graphs and Combinatorics
7
, 1991, pp. 23-29
On the maximal number of certain subgraphs in
K_r
-free graphs
Ervin Györi
,
János Pach
,
Miklós Simonovits
Graphs and Combinatorics
7
, 1991, pp. 31-37
Character table of a controlling association scheme defined by the general orthogonal group
O(3,q)
Wing Man Kwok
Graphs and Combinatorics
7
, 1991, pp. 39-52
Eigenvalues, diameter, and mean distance in graphs
Bojan Mohar
Graphs and Combinatorics
7
, 1991, pp. 53-64
Symmetric Edge-decompositions of hypercubes
Mark Ramras
Graphs and Combinatorics
7
, 1991, pp. 65-87
Perfect graph decompositions
Zsolt Tuza
Graphs and Combinatorics
7
, 1991, pp. 89-93
Set systems with no union of cardinality
0
modulo
m
N. Alon
,
D. Kleitman
,
R. Lipton
,
R. Meshulam
,
M. Rabin
,
J. Spencer
Graphs and Combinatorics
7
, 1991, pp. 97-99
Pancyclism in Chvátal-Erd\Hos's graphs
D. Amar
,
I. Fournier
,
A. Germa
Graphs and Combinatorics
7
, 1991, pp. 101-112
Weighted arcs, the finite Radon transform and a Ramsey problem
Jürgen Bierbrauer
Graphs and Combinatorics
7
, 1991, pp. 113-118
Non removable edges in 3-connected cubic graphs
Jean-Luc Fouquet
,
Henri Thuillier
Graphs and Combinatorics
7
, 1991, pp. 119-141
Vosperian and superconnected Abelian Cayley digraphs
Y.O. Hamidoune
,
A.S. Llado
,
O. Serra
Graphs and Combinatorics
7
, 1991, pp. 143-152
Rotation numbers for complete tripartite graphs
Julie Haviland
,
Andrew Thomason
Graphs and Combinatorics
7
, 1991, pp. 153-163
Interchanging branches and similarity in a tree
I. Krasikov
Graphs and Combinatorics
7
, 1991, pp. 165-175
Connectivity threshold for random chordal graphs
F.R. McMorris
,
Edward R. Scheinerman
Graphs and Combinatorics
7
, 1991, pp. 177-181
Flag transitive planes of order
q^n
with a long cycle
l_\infty
as a collineation
Chihiro Suetake
Graphs and Combinatorics
7
, 1991, pp. 183-195
Graphs with two isomorphism classes of spanning unicyclic subgraphs
Preben Dahl Vestergaard
Graphs and Combinatorics
7
, 1991, pp. 197-204
Research problems - What is the difference between the domination and independent domination numbers of a cubic graph?
Curtiss Barefoot
,
Frank Harary
,
Kathryn F. Jones
Graphs and Combinatorics
7
, 1991, pp. 205-208
The Mann test for divisible difference sets
K.T. Arasu
,
Dieter Jungnickel
,
Alexander Pott
Graphs and Combinatorics
7
, 1991, pp. 209-217
Construction of spherical 4- and 5-designs
Bela Bajnok
Graphs and Combinatorics
7
, 1991, pp. 219-233
Tutte-Martin polynomials and orienting vectors of isotropic systems
André Bouchet
Graphs and Combinatorics
7
, 1991, pp. 235-252
Edge-clique graphs
Gary Chartrand
,
S.F. Kapoor
,
Terry A. McKee
,
Farrokh Saba
Graphs and Combinatorics
7
, 1991, pp. 253-264
Cycles through three vertices in 2-connected graphs
S.C. Locke
,
Cun-Quan Zhang
Graphs and Combinatorics
7
, 1991, pp. 265-269
Seiten 1
2
>