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=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Claude Berge: 5.6.1926-30.6.2002
Vas̑ek Chvátal
Graphs and Combinatorics
19
(1), 2003, pp. 1-6
Advances on the Hamiltonian problem - A survey
Ronald J. Gould
Graphs and Combinatorics
19
(1), 2003, pp. 7-52
On the volume of 4-cycle trades
Darryn Bryant
,
Mike Grannell
,
Terry Griggs
,
Barbara Maenhaut
Graphs and Combinatorics
19
(1), 2003, pp. 53-63
Doubling and tripling constructions for defining sets in Steiner triple systems
Diane Donovan
,
Abdollah Khodkar
,
Anne Penfold Street
Graphs and Combinatorics
19
(1), 2003, pp. 65-89
Pathwidth of planar and line graphs
Fedor V. Fomin
Graphs and Combinatorics
19
(1), 2003, pp. 91-99
On unavoidability of trees with
k
leaves
F. Havet
Graphs and Combinatorics
19
(1), 2003, pp. 101-110
An algorithm to construct
k
-regular
k
-connected graphs with the maximum
k
-diameter
Xinmin Hou
,
Bolian Liu
,
Tianming Wang
Graphs and Combinatorics
19
(1), 2003, pp. 111-119
Marking games and the oriented game chromatic number of partial
k
-trees
H.A. Kierstead
,
Zs. Tuza
Graphs and Combinatorics
19
(1), 2003, pp. 121-129
Maximal energy bipartite graphs
Jack H. Koolen
,
Vincent Moulton
Graphs and Combinatorics
19
(1), 2003, pp. 131-135
Choosability of powers of circuits
Anton Prowse
,
Douglas R. Woodall
Graphs and Combinatorics
19
(1), 2003, pp. 137-144
Chromatic automorphisms of consecutive digraphs
Josep M. Brunat
,
Miguel A. Fiol
,
Montserrat Maureso
Graphs and Combinatorics
19
(2), 2003, pp. 145-159
Separating cycles in doubly toroidal embeddings
M.N. Ellingham
,
Xiaoya Zha
Graphs and Combinatorics
19
(2), 2003, pp. 161-175
Skewness of graphs with small cutsets
Graham Farr
,
Peter Eades
Graphs and Combinatorics
19
(2), 2003, pp. 177-194
Representations of association schemes and their factor schemes
Akihide Hanaki
Graphs and Combinatorics
19
(2), 2003, pp. 195-201
On the classification of self-dual codes over
F_5
Masaaki Harada
,
Patric R.J. Östergård
Graphs and Combinatorics
19
(2), 2003, pp. 203-214
On the complexity of polytope isomorphism problems
Volker Kaibel
,
Alexander Schwartz
Graphs and Combinatorics
19
(2), 2003, pp. 215-230
An extension of the Prüfer code and assembly of connected graphs from their blocks
Hiroshi Kajimoto
Graphs and Combinatorics
19
(2), 2003, pp. 231-239
The linear 2-arboricity of planar graphs
Ko-Wei Lih
,
Li-Da Tong
,
Wei-Fan Wang
Graphs and Combinatorics
19
(2), 2003, pp. 241-248
On some three-color Ramsey numbers
Wai Chee Shiu
,
Peter Che Bor Lam
,
Yusheng Li
Graphs and Combinatorics
19
(2), 2003, pp. 249-258
Connected factors and spanning trees in graphs
Taro Tokuda
,
Baoguang Xu
,
Jianfang Wang
Graphs and Combinatorics
19
(2), 2003, pp. 259-262
Variations on the theorem of Birkhoff-von Neumann and extensions
Dominique de Werra
Graphs and Combinatorics
19
(2), 2003, pp. 263-278
Locally well-dominated and locally independent well-dominated graphs
Igor E. Zverovich
,
Vadim E. Zverovich
Graphs and Combinatorics
19
(2), 2003, pp. 279-288
Factorizations of the complete graph into
C_5
-factors and 1-factors
Peter Adams
,
Darryn Bryant
,
Saad I. El-Zanati
,
Heather Gavlas
Graphs and Combinatorics
19
(3), 2003, pp. 289-296
0-dual closures for several classes of graphs
Ahmed Ainouche
,
Ingo Schiermeyer
Graphs and Combinatorics
19
(3), 2003, pp. 297-307
Links between the Slater index and the Ryser index of tournaments
Irène Charon
,
Olivier Hudry
Graphs and Combinatorics
19
(3), 2003, pp. 309-322
Seiten 1
2
3
>