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=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Transversal numbers of uniform hypergraphs
Noga Alon
Graphs and Combinatorics
6
, 1990, pp. 1-4
Totient-numbers of the rectangular association scheme
Thomas Bier
Graphs and Combinatorics
6
, 1990, pp. 5-15
Colouring prime distance graphs
R.B. Eggleton
,
P. Erdŏs
,
D.K. Skilton
Graphs and Combinatorics
6
, 1990, pp. 17-32
Some applications of the Nash-Williams lemma to the edge-reconstruction conjecture
I. Krasikov
,
Y. Roditty
Graphs and Combinatorics
6
, 1990, pp. 37-39
On well-quasi ordering finite structures with labels
Igor Kȓíz̑
,
Robin Thomas
Graphs and Combinatorics
6
, 1990, pp. 41-49
Contractions and minimal
k
-colorability
Zsolt Tuza
Graphs and Combinatorics
6
, 1990, pp. 51-59
Strongly regular graphs and Hurwitz-Radon numbers
Paul Y.H. Yiu
Graphs and Combinatorics
6
, 1990, pp. 61-69
On barrier sets of star-factors
Qinglin Yu
Graphs and Combinatorics
6
, 1990, pp. 71-76
Biased graphs whose matroids are special binary matroids
Thomas Zaslavsky
Graphs and Combinatorics
6
, 1990, pp. 77-93
On a generalized family of colorings
Pierre Baldi
Graphs and Combinatorics
6
, 1990, pp. 95-110
Events correlated with respect to every subposet of a fixed poset
Graham R. Brightwell
Graphs and Combinatorics
6
, 1990, pp. 111-131
On the number of alignments of
k
-sequences
J.R. Griggs
,
P. Hanlon
,
A.M. Odlyzko
,
M.S. Waterman
Graphs and Combinatorics
6
, 1990, pp. 133-146
A note on the addition of residues
Yahya Ould Hamidoune
Graphs and Combinatorics
6
, 1990, pp. 147-152
An upper bound for the total chromatic number
H.R. Hind
Graphs and Combinatorics
6
, 1990, pp. 153-159
Covering a graph by topological complete subgraphs
L.K. Jrgensen
,
L. Pyber
Graphs and Combinatorics
6
, 1990, pp. 161-171
A bijective proof of Kadell's conjecture on plane partitions
Dongsu Kim
Graphs and Combinatorics
6
, 1990, pp. 173-178
Every
4k
-edge-connected graph is weakly
3k
-linked
Haruko Okamura
Graphs and Combinatorics
6
, 1990, pp. 179-185
On Ramsey families of sets
Vojtȇch Rödl
Graphs and Combinatorics
6
, 1990, pp. 187-195
Packing two graphs of order
n
having total size at most
2n - 2
S.K. Teo
,
H.P. Yap
Graphs and Combinatorics
6
, 1990, pp. 197-205
The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets
Philip L. Bowers
Graphs and Combinatorics
6
, 1990, pp. 207-222
Asymptotic solution of a Turán-type problem
P. Frankl
Graphs and Combinatorics
6
, 1990, pp. 223-227
Ordering trees by algebraic connectivity
Robert Grone
,
Russell Merris
Graphs and Combinatorics
6
, 1990, pp. 229-237
Minimal subschemes of the group association schemes of Mathieu groups
Yasushi Iwakata
Graphs and Combinatorics
6
, 1990, pp. 239-244
A sufficient condition fo a graph to have
[a,b]
-factors
Mikio Kano
Graphs and Combinatorics
6
, 1990, pp. 245-251
Minimum degree of bipartite graphs and the existence of
k
-factors
P. Katerinis
Graphs and Combinatorics
6
, 1990, pp. 253-258
Seiten 1
2
>