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 Volume=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Goodness of trees for generalized books
S.A. Burr
,
P. Erdŏs
,
R.J. Faudree
,
C.C. Rousseau
,
R.H. Schelp
,
R.J. Gould
,
M.S. Jacobson
Graphs and Combinatorics
3
, 1987, pp. 1-6
Spectra of unicyclic graphs
Dragos̑ Cvetković
,
Peter Rowlinson
Graphs and Combinatorics
3
, 1987, pp. 7-23
Codes with given distances
H. Enomoto
,
P. Frankl
,
N. Ito
,
K. Nomura
Graphs and Combinatorics
3
, 1987, pp. 25-38
Embedding graphs in Cayley graphs
Chris D. Godsil
,
Wilfried Imrich
Graphs and Combinatorics
3
, 1987, pp. 39-43
The class reconstruction number of maximal planar graphs
Frank Harary
,
Josef Lauri
Graphs and Combinatorics
3
, 1987, pp. 45-53
On the number of faces of centrally-symmetric simplicial polytopes
Richard P. Stanley
Graphs and Combinatorics
3
, 1987, pp. 55-66
Linear upper bounds for local Ramsey numbers
Miroslaw Truszczynski
,
Zsolt Tuza
Graphs and Combinatorics
3
, 1987, pp. 67-73
Inequalities for two set systems with prescribed intersections
Zsolt Tuza
Graphs and Combinatorics
3
, 1987, pp. 75-80
On schematic orthogonal arrays
OA(q^t,k,q,t)
Mitsuo Yoshizawa
Graphs and Combinatorics
3
, 1987, pp. 81-89
On the kernel of intersecting families
Noga Alon
,
Z. Füredi
Graphs and Combinatorics
3
, 1987, pp. 91-94
On distance-regular graphs with fixed valency
Eiichi Bannai
,
Tatsuro Ito
Graphs and Combinatorics
3
, 1987, pp. 95-109
The maximum number of edges in a 3-graph not containing a given star
F.R.K. Chung
,
P. Frankl
Graphs and Combinatorics
3
, 1987, pp. 111-126
Bull-free Berge graphs are perfect
Vas̑ek Chvátal
,
Najiba Sbihi
Graphs and Combinatorics
3
, 1987, pp. 127-139
On a theorem of Ganley
Dieter Jungnickel
Graphs and Combinatorics
3
, 1987, pp. 141-143
Large independent sets in shift-invariant graphs - Solution of Bergelson's problem
Igor Kȓíz̑
Graphs and Combinatorics
3
, 1987, pp. 145-158
Paths and edge-connectivity in graphs III - Six-terminal
k
paths
Haruko Okamura
Graphs and Combinatorics
3
, 1987, pp. 159-189
Maximum bipartite subgraphs of Kneser graphs
Svatopluk Poljak
,
Zsolt Tuza
Graphs and Combinatorics
3
, 1987, pp. 191-199
Research problems - Maximum induced forests of planar graphs
Jin Akiyama
,
Mamoru Watanabe
Graphs and Combinatorics
3
, 1987, pp. 201-202
Large induced degenerate subgraphs
Noga Alon
,
J. Kahn
,
P.D. Seymour
Graphs and Combinatorics
3
, 1987, pp. 203-211
Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials
Janet Simpson Beissinger
,
Uri N. Peled
Graphs and Combinatorics
3
, 1987, pp. 213-219
Some new Hadamard matrices
V.N. Bhat-Nayak
,
N. Ito
,
A. Wirmani-Prasad
Graphs and Combinatorics
3
, 1987, pp. 221-225
On randomly
n
-cyclic digraphs
Yoshimi Egawa
,
Takashi Miyamoto
,
Sergio Ruiz
Graphs and Combinatorics
3
, 1987, pp. 227-238
Hamiltonian dicycles avoiding prescribed arcs in tournaments
Pierre Fraisse
,
Carsten Thomassen
Graphs and Combinatorics
3
, 1987, pp. 239-250
The maximum number of balancing sets
Zoltán Füredi
Graphs and Combinatorics
3
, 1987, pp. 251-254
Some topics in cochromatic theory
John Gimbel
,
H. Joseph Straight
Graphs and Combinatorics
3
, 1987, pp. 255-265
Seiten 1
2
>