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=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Connected factors in graphs - A survey
Mekkia Kouider
,
Preben Dahl Vestergaard
Graphs and Combinatorics
21
(1), 2005, pp. 1-26
Vertices of degree 5 in a contraction critically 5-connected graph
Kiyoshi Ando
,
Atsushi Kaneko
,
Ken-ichi Kawarabayashi
Graphs and Combinatorics
21
(1), 2005, pp. 27-37
Minimally
k
-edge-connected directed graphs of maximal size
Alex R. Berg
,
Tibor Jordán
Graphs and Combinatorics
21
(1), 2005, pp. 39-50
The flagged Cauchy determinant
William Y.C. Chen
,
Christian Krattenthaler
,
Arthur L.B. Yang
Graphs and Combinatorics
21
(1), 2005, pp. 51-62
On the total domination number of Cartesian products of graphs
Michael A. Henning
,
Douglas F. Rall
Graphs and Combinatorics
21
(1), 2005, pp. 63-69
3-wise exactly 1-intersecting families of sets
Zsolt Katona
Graphs and Combinatorics
21
(1), 2005, pp. 71-76
Spanning trails connecting given edges
Hong-Jian Lai
,
Xiangwen Li
,
Hoifung Poon
,
Yongbin Ou
Graphs and Combinatorics
21
(1), 2005, pp. 77-88
The crossing number of
C(mk;\{1, k\})
Xiaohui Lin
,
Yuansheng Yang
,
Jianguo Lü
,
Xin Hao
Graphs and Combinatorics
21
(1), 2005, pp. 89-96
One-dimensional tilings using tiles with two gap lengths
Tomoki Nakamigawa
Graphs and Combinatorics
21
(1), 2005, pp. 97-105
Euler tours of maximum girth in
K_{2n+1}
and
K_{2n,2n}
Natalia Oksimets
Graphs and Combinatorics
21
(1), 2005, pp. 107-118
Graphs of large girth with prescribed partial circular colourings
Zhishi Pan
,
Xuding Zhu
Graphs and Combinatorics
21
(1), 2005, pp. 119-129
On the nonembeddability and crossing numbers of some Kleinical polyhedral maps on the torus
Adrian Riskin
Graphs and Combinatorics
21
(1), 2005, pp. 131-135
A note on the shortness coefficient and the Hamiltonicity of 4-connected line graphs
Liming Xiong
,
Roman Kuz̑el
Graphs and Combinatorics
21
(1), 2005, pp. 137-144
Canonical pattern Ramsey numbers
Maria Axenovich
,
Robert E. Jamison
Graphs and Combinatorics
21
(2), 2005, pp. 145-160
On cross-intersecting families of sets
Christian Bey
Graphs and Combinatorics
21
(2), 2005, pp. 161-168
Packing
\lambda
-fold complete multipartite graphs with 4-cycles
Elizabeth J. Billington
,
Hung-Lin Fu
,
C.A. Rodger
Graphs and Combinatorics
21
(2), 2005, pp. 169-185
Quaternionic starters
Arrigo Bonisoli
,
Gloria Rinaldi
Graphs and Combinatorics
21
(2), 2005, pp. 187-195
Minimal degree and
(k, m)
-pancyclic ordered graphs
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Graphs and Combinatorics
21
(2), 2005, pp. 197-211
A note on a generalisation of Ore's condition
Evelyne Flandrin
,
Hao Li
,
Antoni Marczyk
,
Mariusz Woźniak
Graphs and Combinatorics
21
(2), 2005, pp. 213-216
Claw conditions for heavy cycles in weighted graphs
Jun Fujisawa
Graphs and Combinatorics
21
(2), 2005, pp. 217-229
Constructions of quad-rooted double covers
Gennian Ge
,
Alan C.H. Ling
Graphs and Combinatorics
21
(2), 2005, pp. 231-238
Chromatic index critical graphs of even order with five major vertices
Zi-Xia Song
,
H.P. Yap
Graphs and Combinatorics
21
(2), 2005, pp. 239-246
Exact
k
-wise intersection theorems
Tibor Szabó
,
V.H. Vu
Graphs and Combinatorics
21
(2), 2005, pp. 247-261
The displacement and split decompositions for a
Q
-polynomial distance-regular graph
Paul Terwilliger
Graphs and Combinatorics
21
(2), 2005, pp. 263-276
The domination parameters of cubic graphs
Igor E. Zverovich
,
Vadim E. Zverovich
Graphs and Combinatorics
21
(2), 2005, pp. 277-288
Seiten 1
2
>