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=2
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On Hamilton decompositions of prisms over simple 3-polytopes
Brian Alspach
,
Moshe Rosenfeld
Graphs and Combinatorics
2
, 1986, pp. 1-8
Generating and counting valid patterns in routes between two points
Tetsuo Asano
Graphs and Combinatorics
2
, 1986, pp. 9-13
Symmetry and classification of certain regular group divisible designs
Pannalal Bhagwandas
,
Sanpei Kageyama
,
Rahul Mukerjee
Graphs and Combinatorics
2
, 1986, pp. 15-20
Uniqueness and nonexistence of some graphs related to
M_{22}
A.E. Brouwer
Graphs and Combinatorics
2
, 1986, pp. 21-29
Monotone subsequences in
(0,1)
-matrices
F.R.K. Chung
,
P.C. Fishburn
,
V.K. Wei
Graphs and Combinatorics
2
, 1986, pp. 31-36
Toughness and the existence of
k
-factors - II
Hikoe Enomoto
Graphs and Combinatorics
2
, 1986, pp. 37-42
Compatible additive permutations of finite integral bases
P.D. Johnson
,
D.G. Rogers
Graphs and Combinatorics
2
, 1986, pp. 43-53
Coloring of universal graphs
Peter Komjáth
,
Vojtèch Rödl
Graphs and Combinatorics
2
, 1986, pp. 55-60
A note on
f
-factors in directed and undirected multigraphs
Pierre Fraisse
,
Pavol Hell
,
David G. Kirkpatrick
Graphs and Combinatorics
2
, 1986, pp. 61-66
t
-expansive and
t
-wise intersecting hypergraphs
Z. Füredi
Graphs and Combinatorics
2
, 1986, pp. 67-80
A new construction for Williamson-type matrices
Jennifer Seberry
Graphs and Combinatorics
2
, 1986, pp. 81-87
Research problems - The chromatic index of simple hypergraphs
Z. Füredi
Graphs and Combinatorics
2
, 1986, pp. 89-92
Decomposition of the complete
r
-graph into complete
r
-partite
r
-graphs
Noga Alon
Graphs and Combinatorics
2
, 1986, pp. 95-100
Association schemes and quadratic transformations for orthogonal polynomials
Laura Chihara
,
Dennis Stanton
Graphs and Combinatorics
2
, 1986, pp. 101-112
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
Péter L. Erdŏs
,
P. Frankl
,
V. Rödl
Graphs and Combinatorics
2
, 1986, pp. 113-121
Convex hulls of more-part Sperner families
Péter L. Erdŏs
,
G.O.H. Katona
Graphs and Combinatorics
2
, 1986, pp. 123-134
Large triangle-free subgraphs in graphs without
K_4
P. Frankl
,
V. Rödl
Graphs and Combinatorics
2
, 1986, pp. 135-144
On the nonexistence of nontrivial perfect
e
-codes and tight
2e
-designs in Hamming schemes
H(n,q)
with
e \ge 3
and
q \ge 3
Yiming Hong
Graphs and Combinatorics
2
, 1986, pp. 145-164
Rulers and slaves in a random social group
Zbigniew Palka
Graphs and Combinatorics
2
, 1986, pp. 165-172
How to find many counterfeit coins?
L. Pyber
Graphs and Combinatorics
2
, 1986, pp. 173-177
Hadamard matrices generated by an adaptation of generalized quaternion type array
Mieko Yamada
Graphs and Combinatorics
2
, 1986, pp. 179-187
Research problems - Two problems in extremal graph theory
Péter L. Erdŏs
Graphs and Combinatorics
2
, 1986, pp. 189-190
Spanning tree formulas and Chebyshev polynomials
F.T. Boesch
,
H. Prodinger
Graphs and Combinatorics
2
, 1986, pp. 191-200
Uniquely cocolourable graphs
I. Broere
,
M. Burger
Graphs and Combinatorics
2
, 1986, pp. 201-208
Critical star multigraphs
A.G. Chetwynd
,
A.J.W. Hilton
Graphs and Combinatorics
2
, 1986, pp. 209-221
Seiten 1
2
>