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=18
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A survey on contractible edges in graphs of a prescribed vertex connectivity
Matthias Kriesell
Graphs and Combinatorics
18
(1), 2002, pp. 1-30
On the Hamilton-Waterloo problem
Peter Adams
,
Elizabeth J. Billington
,
Darryn E. Bryant
,
Saad I. El-Zanati
Graphs and Combinatorics
18
(1), 2002, pp. 31-51
The Moore bound for irregular graphs
Noga Alon
,
Shlomo Hoory
,
Nathan Linial
Graphs and Combinatorics
18
(1), 2002, pp. 53-57
Shattering news
R.P. Anstee
,
Lajos Rónyai
,
Attila Sali
Graphs and Combinatorics
18
(1), 2002, pp. 59-73
Edge maximal non-bipartite graphs without odd cycles of prescribed lengths
Louis Caccetta
,
Rui-Zhong Jia
Graphs and Combinatorics
18
(1), 2002, pp. 75-92
Enumerating foldings and unfoldings between polygons and polytopes
Erik D. Demaine
,
Martin L. Demaine
,
Anna Lubiw
,
Joseph O'Rourke
Graphs and Combinatorics
18
(1), 2002, pp. 93-104
The diameters of some transition graphs constructed from Hamilton cycles
Mariko Hagita
,
Yoshiaki Oda
,
Katsuhiro Ota
Graphs and Combinatorics
18
(1), 2002, pp. 105-117
n
-tuple coloring of planar graphs with large odd girth
William Klostermeyer
,
Cun Quan Zhang
Graphs and Combinatorics
18
(1), 2002, pp. 119-132
Upper bounds to the number of vertices in a
k
-critically
n
-connected graph
Matthias Kriesell
Graphs and Combinatorics
18
(1), 2002, pp. 133-146
Group chromatic number of graphs without
K_5
-minors
Hong-Jian Lai
,
Xiankun Zhang
Graphs and Combinatorics
18
(1), 2002, pp. 147-154
A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths
Uwe Leck
Graphs and Combinatorics
18
(1), 2002, pp. 155-167
Balanced convex partitions of measures in
R^2
Toshinori Sakai
Graphs and Combinatorics
18
(1), 2002, pp. 169-192
A fan type condition for heavy cycles in weighted graphs
Shenggui Zhang
,
Hajo Broersma
,
Xueliang Li
,
Ligong Wang
Graphs and Combinatorics
18
(1), 2002, pp. 193-200
Cycles with prescribed and forbidden sets of elements in cubic graphs
Sheng Bau
Graphs and Combinatorics
18
(2), 2002, pp. 201-208
The convexity number of a graph
Gary Chartrand
,
Curtiss E. Wall
,
Ping Zhang
Graphs and Combinatorics
18
(2), 2002, pp. 209-217
A note on graph pebbling
Andrzej Czygrinow
,
Glenn Hurlbert
,
H.A. Kierstead
,
William T. Trotter
Graphs and Combinatorics
18
(2), 2002, pp. 219-225
Solitaire lattices
Antoine Deza
,
Shmuel Onn
Graphs and Combinatorics
18
(2), 2002, pp. 227-243
Ramsey-type results for unions of comparability graphs
Adrian Dumitrescu
,
Géza Tóth
Graphs and Combinatorics
18
(2), 2002, pp. 245-251
Automorphism groups of 2-valent connected Cayley digraphs on regular
p
-groups
Yan-Quan Feng
,
Ru-Ji Wang
,
Ming-Yao Xu
Graphs and Combinatorics
18
(2), 2002, pp. 253-257
Construction of Hamiltonian cycles in layered cubic planar graphs
D.S. Franzblau
Graphs and Combinatorics
18
(2), 2002, pp. 259-270
Fibonacci polynomials and parity domination in grid graphs
John Goldwasser
,
William Klostermeyer
,
Henry Ware
Graphs and Combinatorics
18
(2), 2002, pp. 271-283
Orthogonal decompositions of complete digraphs
Sven Hartmann
Graphs and Combinatorics
18
(2), 2002, pp. 285-302
Edge-colorings with no large polychromatic stars
Tao Jiang
Graphs and Combinatorics
18
(2), 2002, pp. 303-308
The chromatic spectrum of mixed hypergraphs
Tao Jiang
,
Dhruv Mubayi
,
Zsolt Tuza
,
Vitaly Voloshin
,
Douglas B. West
Graphs and Combinatorics
18
(2), 2002, pp. 309-318
Some properties of Hadamard matrices coming from dihedral groups
Hiroshi Kimura
,
Takashi Niwasaki
Graphs and Combinatorics
18
(2), 2002, pp. 319-327
Seiten 1
2
3
>