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=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the asymptotic behavior of the independence number of a random
(n,n)
-tree
J.H. Cho
,
E.M. Palmer
Graphs and Combinatorics
12
, 1996, pp. 1-8
Cycle-pancyclism in tournaments II
Hortensia Galeana-Sánchez
,
Sergio Rajsbaum
Graphs and Combinatorics
12
, 1996, pp. 9-16
The toughness of cubic graphs
Wayne Goddard
Graphs and Combinatorics
12
, 1996, pp. 17-22
A constant bound on the number of columns
(1,k-2,1)
in the intersection array of a distance-regular graph
Akira Hiraki
Graphs and Combinatorics
12
, 1996, pp. 23-37
The Terwilliger algebras of certain association schemes over the Galois rings of characteristic 4
Haruo Ishibashi
Graphs and Combinatorics
12
, 1996, pp. 39-54
An inequality for Steiner systems II
Ryuzaburo Noda
Graphs and Combinatorics
12
, 1996, pp. 55-58
On fixing edges in graph minors
Talmage James Reid
Graphs and Combinatorics
12
, 1996, pp. 59-68
Reconstruction of the set of branches of a graph
Andrew Vince
,
Yongzhi Yang
Graphs and Combinatorics
12
, 1996, pp. 69-80
Open shop scheduling with some additional constraints
D. de Werra
,
J. Erschler
Graphs and Combinatorics
12
, 1996, pp. 81-93
Optimal pairs of incomparable clouds in multisets
Rudolf Ahlswede
,
Levon H. Khachatrian
Graphs and Combinatorics
12
, 1996, pp. 97-137
Generating the centrally symmetric 3-polyhedral graphs
D.W. Barnette
Graphs and Combinatorics
12
, 1996, pp. 139-147
The Ramsey property for collections of sequences not containing all arithmetic progressions
Tom C. Brown
,
Bruce M. Landman
Graphs and Combinatorics
12
, 1996, pp. 149-161
TMC tetrahedral types MOD
2k+1
and their structure graphs
I.J. Dejter
Graphs and Combinatorics
12
, 1996, pp. 163-178
On the isomorphisms and automorphism groups of circulants
Qiongxiang Huang
,
Jixiang Meng
Graphs and Combinatorics
12
, 1996, pp. 179-187
Polynomial invariants of graphs II
Seiya Negami
,
Katsuhiro Ota
Graphs and Combinatorics
12
, 1996, pp. 189-198
Some results on generalized Latin square
Tiong-Seng Tay
Graphs and Combinatorics
12
, 1996, pp. 199-207
Some panconnected and pancyclic properties of graphs with a local Ore-type condition
A.S. Asratian
,
G.V. Sarkisian
Graphs and Combinatorics
12
, 1996, pp. 209-219
On the chromatic uniqueness of the graph
W(n,n-2,k)
F.M. Dong
,
Y.P. Liu
Graphs and Combinatorics
12
, 1996, pp. 221-230
Extensions and consequences of Chvátal-Erd\Hos' theorem
J. van den Heuvel
Graphs and Combinatorics
12
, 1996, pp. 231-237
Isoperimetric numbers of graph bundles
Jin Ho Kwak
,
Jaeun Lee
,
Moo Young Sohn
Graphs and Combinatorics
12
, 1996, pp. 239-251
Incomplete orthogonal arrays and idempotent orthogonal arrays
Francis Maurin
Graphs and Combinatorics
12
, 1996, pp. 253-266
Modular intersection graphs
F.R. McMorris
,
Chi Wang
Graphs and Combinatorics
12
, 1996, pp. 267-281
A family of multiply extended grids
Thomas Meixner
,
Antonio Pasini
Graphs and Combinatorics
12
, 1996, pp. 283-293
On the connectivity of unit distance graphs
Michael Reid
Graphs and Combinatorics
12
, 1996, pp. 295-303
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters
Dalibor Fronc̑ek
Graphs and Combinatorics
12
, 1996, pp. 305-320
Seiten 1
2
>