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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Packing and covering triangles in triparitite graphs
P.E. Haxell
,
Y. Kohayakawa
Graphs and Combinatorics
14
(1), 1998, pp. 1-10
A construction for resolvable designs and its generalizations
Sampei Kageyama
,
Ying Miao
Graphs and Combinatorics
14
(1), 1998, pp. 11-24
On clique growth in products of directed graphs
János Körner
Graphs and Combinatorics
14
(1), 1998, pp. 25-36
Isomorphisms of connected Cayley digraphs
Cai Heng Li
Graphs and Combinatorics
14
(1), 1998, pp. 37-44
Hamiltonian conncetedness in claw-free graphs
MingChu Li
Graphs and Combinatorics
14
(1), 1998, pp. 45-58
The thickness of graphs: A survey
Petra Mutzel
,
Thomas Odenthal
,
Mark Scharbrodt
Graphs and Combinatorics
14
(1), 1998, pp. 59-73
Ramsey-type theorem for spatial graphs
Seiya Negami
Graphs and Combinatorics
14
(1), 1998, pp. 75-80
On
d
-diagonal colorings of embedded graphs of low maximum face size
Daniel P. Sanders
,
Yue Zhao
Graphs and Combinatorics
14
(1), 1998, pp. 81-94
Constructions of spherical 3-designs
Béla Bajnok
Graphs and Combinatorics
14
(2), 1998, pp. 97-107
On the structure of digraphs with order close to the Moore bound
Edy Tri Baskoro
,
Mirka Miller
,
Ján Plesník
Graphs and Combinatorics
14
(2), 1998, pp. 109-119
Relaxed coloring of a graph
Walter Deuber
,
Xuding Zhu
Graphs and Combinatorics
14
(2), 1998, pp. 121-130
Ramsey functions for quasi-progressions
Bruce M. Landman
Graphs and Combinatorics
14
(2), 1998, pp. 131-142
Bridge obstructions to circular-three gate matrix layout
Nancy Lawson
,
M.S. Krishnamoorthy
Graphs and Combinatorics
14
(2), 1998, pp. 143-153
The
k
th upper multiexponents of primitive matrices
Bolian Liu
,
Zhou Bo
Graphs and Combinatorics
14
(2), 1998, pp. 155-162
On maximum-sized near-regular and
\sqrt[6]{1}
-matroids
James Oxley
,
Dirk Vertigan
,
Geoff Whittle
Graphs and Combinatorics
14
(2), 1998, pp. 163-179
On tournaments free of large transitive subtournaments
Adolfo Sanchez-Flores
Graphs and Combinatorics
14
(2), 1998, pp. 181-200
A note on labeling of graphs
G. Suresh Singh
Graphs and Combinatorics
14
(2), 1998, pp. 201-207
Maximal trees with bounded maximum degree in a graph
Min Aung
,
Aung Kyaw
Graphs and Combinatorics
14
(3), 1998, pp. 209-221
Complexity and algoritms for graph and hypergraph sandwich problems
Martin Charles Golumbic
,
Amir Wassermann
Graphs and Combinatorics
14
(3), 1998, pp. 223-239
Graphical basis partitions
Jennifer M. Nolan
,
Vijay Sivaraman
,
Carla D. Savage
,
Pranav K. Tiwari
Graphs and Combinatorics
14
(3), 1998, pp. 241-261
On the panconnectivity of graphs with large degrees and neighborhood unions
B. Wei
,
Y. Zhu
Graphs and Combinatorics
14
(3), 1998, pp. 263-274
Weak-geodetically closed subgraphs in distance-regular graphs
Chih-Wen Weng
Graphs and Combinatorics
14
(3), 1998, pp. 275-304
Frankl's conjecture is true for modular lattices
Tetsuya Abe
,
Bumpei Nakano
Graphs and Combinatorics
14
(4), 1998, pp. 305-311
On two-way designs
Sunanda Bagchi
Graphs and Combinatorics
14
(4), 1998, pp. 313-319
Spectra of bipartite
P
- and
Q
-polynomial association schemes
John S. Caughman IV
Graphs and Combinatorics
14
(4), 1998, pp. 321-343
Seiten 1
2
>