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=1985
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cycles through four edges in 3-connected cubic graphs
R.E.L. Aldred
,
D.A. Holton
,
C. Thomassen
Graphs and Combinatorics
1
, 1985, pp. 7-
The maximum number of disjoint pairs in a family of subsets
N. Alon
,
P. Frankl
Graphs and Combinatorics
1
, 1985, pp. 13-21
An anti-Ramsey theorem
László Babai
Graphs and Combinatorics
1
, 1985, pp. 23-28
Randomly
n
-cyclic digraphs
Gary Chartrand
,
Ortrud R. Oellermann
,
Sergio Ruiz
Graphs and Combinatorics
1
, 1985, pp. 29-40
On the addressing problem for directed graphs
F.R.K. Chung
,
R.L. Graham
,
P.M. Winkler
Graphs and Combinatorics
1
, 1985, pp. 41-50
A Ramsey-Sperner theorem
Z. Füredi
Graphs and Combinatorics
1
, 1985, pp. 51-56
Hadamard graphs - I
Noboru Ito
Graphs and Combinatorics
1
, 1985, pp. 57-64
Hyperconnectivity of graphs
Gil Kalai
Graphs and Combinatorics
1
, 1985, pp. 65-79
Paths in graphs, reducing the edge-connectivity only by two
W. Mader
Graphs and Combinatorics
1
, 1985, pp. 81-89
On graphs with small subgraphs of large chromatic number
V. Rödl
,
R.A. Duke
Graphs and Combinatorics
1
, 1985, pp. 91-96
Maximal arcs in designs
Sharad S. Sane
,
S.S. Shrikhande
,
N.M. Singhi
Graphs and Combinatorics
1
, 1985, pp. 97-106
Research problems - A new approach to Turán's conjecture
Gil Kalai
Graphs and Combinatorics
1
, 1985, pp. 107-109
On factors with all degrees odd
Atsushi Amahashi
Graphs and Combinatorics
1
, 1985, pp. 111-114
List-colourings of graphs
B. Bollobás
,
A.J. Harris
Graphs and Combinatorics
1
, 1985, pp. 115-127
Cyclic automorphisms of a countable graph and random sum-free sets
Peter J. Cameron
Graphs and Combinatorics
1
, 1985, pp. 129-135
On the regulation number of a multigraph
Gary Chartrand
,
Frank Harary
,
Ortrud R. Oellermann
Graphs and Combinatorics
1
, 1985, pp. 137-144
The lexicograpic sum of Cohen-Macaulay and shellable ordered sets
Jerrold R. Griggs
,
Andrew R. Kustin
,
Jeffrey A. Ross
,
Jürgen Stahl
Graphs and Combinatorics
1
, 1985, pp. 145-163
Classification of 2-transitive symmetric designs
William M. Kantor
Graphs and Combinatorics
1
, 1985, pp. 165-166
A generalization of a theorem of Kruskal
Michael Mörs
Graphs and Combinatorics
1
, 1985, pp. 167-183
A Hadamard matrix of order 268
Kazue Sawade
Graphs and Combinatorics
1
, 1985, pp. 185-187
The spectrum of nested Steiner triple systems
D.R. Stinson
Graphs and Combinatorics
1
, 1985, pp. 189-191
Counting labelled chordal graphs
Nicholas C. Wormald
Graphs and Combinatorics
1
, 1985, pp. 193-200
Research Problems - Smallest regular graphs with girth pair
(4,2T + 1)
Feng Tian
,
Deng Xiao-tie
,
Shi Rong-hua
Graphs and Combinatorics
1
, 1985, pp. 201-202
Hyperplane codes
Thomas Bier
Graphs and Combinatorics
1
, 1985, pp. 207-212
Lower bounds for Turán's problem
Peter Frankl
,
Vojtȇch Rödl
Graphs and Combinatorics
1
, 1985, pp. 213-216
Seiten 1
2
>