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=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cycles in partially square graphs
Ahmed Ainouche
,
Mekkia Kouider
Graphs and Combinatorics
17
(1), 2001, pp. 1-9
Linear arboricity and linear
k
-arboricity of regular graphs
Noga Alon
,
V.J. Teague
,
N.C. Wormald
Graphs and Combinatorics
17
(1), 2001, pp. 11-16
List-compactness of infinite directed graphs
Bruce L. Bauslaugh
Graphs and Combinatorics
17
(1), 2001, pp. 17-38
Trades and graphs
Elizabeth J. Billington
,
D.G. Hoffman
Graphs and Combinatorics
17
(1), 2001, pp. 39-54
Star decompositions of cubes
Darryn E. Bryant
,
Saad El-Zanati
,
Charles Vanden Eynden
,
Dean G. Hoffman
Graphs and Combinatorics
17
(1), 2001, pp. 55-59
Degree sums and path-factors in graphs
Yaojun Chen
,
Feng Tian
,
Bing Wei
Graphs and Combinatorics
17
(1), 2001, pp. 61-71
Maximal
\tau
-critical linear hypergraphs
Zoltán Füredi
Graphs and Combinatorics
17
(1), 2001, pp. 73-78
On optimal orientations of Cartesian products of trees
Khee Meng Koh
,
E.G. Tay
Graphs and Combinatorics
17
(1), 2001, pp. 79-97
From intersectors to successors
Yaakov S. Kupitz
,
Horst Martini
Graphs and Combinatorics
17
(1), 2001, pp. 99-111
A sufficient condition for a graph to have a
k
-tree
Aung Kyaw
Graphs and Combinatorics
17
(1), 2001, pp. 113-121
Asymptotic upper bounds for Ramsey functions
Yusheng Li
,
Cecil C. Rousseau
,
Wenan Zang
Graphs and Combinatorics
17
(1), 2001, pp. 123-128
On cycle sequences
Ko-Wei Lihy
,
Li-Da Tong
,
Jing-Ho Yan
Graphs and Combinatorics
17
(1), 2001, pp. 129-133
Colouring arcwise connected sets in the plane II
Sean McGuinness
Graphs and Combinatorics
17
(1), 2001, pp. 135-148
Tight distance-regular graphs and the
Q
-polynomial property
Arlene A. Pascasio
Graphs and Combinatorics
17
(1), 2001, pp. 149-169
Super-magic complete
k
-partite hypergraphs
Marián Trenkler
Graphs and Combinatorics
17
(1), 2001, pp. 171-175
On independent cycles in a bipartite graph
Hong Wang
Graphs and Combinatorics
17
(1), 2001, pp. 177-183
An inextensible association scheme associated with a 4-regular graph
Jerzy Wojdyƚo
Graphs and Combinatorics
17
(1), 2001, pp. 185-192
Bi-embeddings of Steiner triple systems of order 15
G.K. Bennett
,
M.J. Grannell
,
T.S. Griggs
Graphs and Combinatorics
17
(2), 2001, pp. 193-197
On the Oberwolfach problem with two similar length cycles
Darryn E. Bryant
Graphs and Combinatorics
17
(2), 2001, pp. 199-206
Families of graphs closed under taking powers
Mingjang Chen
,
Gerard J. Chang
Graphs and Combinatorics
17
(2), 2001, pp. 207-212
On fixed edges and edge-reconstrtuction of series-parallel networks
Hongbing Fan
,
Yu-Liang Wu
,
C.K. Wong
Graphs and Combinatorics
17
(2), 2001, pp. 213-225
Domination graphs with nontrivial components
David C. Fisher
,
David Guichard
,
J. Richard Lundgren
,
Sarah K. Merz
,
K. Brooks Reid
Graphs and Combinatorics
17
(2), 2001, pp. 227-236
Intersection graphs and the clique operator
Marisa Gutierrez
Graphs and Combinatorics
17
(2), 2001, pp. 237-244
On the strong product of a
k
-extendable and an
l
-extendable graphs
Ervin Gyŏri
,
Wilfried Imrich
Graphs and Combinatorics
17
(2), 2001, pp. 245-253
Subgraphs of random match-graphs
Jerzy Jaworski
,
Zbigniew Palka
Graphs and Combinatorics
17
(2), 2001, pp. 255-264
Seiten 1
2
3
>