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=J. Graph Theory AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Forbidden subgraphs and bounds on the size of a maximum matching
Michael D. Plummer
,
Akira Saito
Journal of Graph Theory
50
(1), 2005, pp. 1-12
Normal circulant graphs with noncyclic regular subgroups
Dragan Marus̑ic̑
,
Joy Morris
Journal of Graph Theory
50
(1), 2005, pp. 13-24
The edge-transitive but not vertex-transitive cubic graph on 112 vertices
Marston Conder
,
Aleksander Malnic̑
,
Dragan Marus̑ic̑
,
Tomaz̑ Pisanski
,
Primoz̑ Potoc̑nik
Journal of Graph Theory
50
(1), 2005, pp. 25-42
An improvement of the crossing number bound
Bernard Montaron
Journal of Graph Theory
50
(1), 2005, pp. 43-54
Degree bounds for the circumference of 3-connected graphs
Heinz A. Jung
,
Elkin Vumar
Journal of Graph Theory
50
(1), 2005, pp. 55-78
Nowhere-zero 3-flows in products of graphs
Jinlong Shu
,
Cun-Quan Zhang
Journal of Graph Theory
50
(1), 2005, pp. 79-89
Disjoint directed quadrilaterals in a directed graph
Danhong Zhang
,
Hong Wang
Journal of Graph Theory
50
(2), 2005, pp. 91-104
Regular orientable embeddings of complete bipartite graphs
Jin Ho Kwak
,
Young Soo Kwon
Journal of Graph Theory
50
(2), 2005, pp. 105-122
A note on group colorings
Daniel Král'
,
Ondȓej Pangrác
,
Heinz-Jürgen Voss
Journal of Graph Theory
50
(2), 2005, pp. 123-129
Hamilton connectivity of line graphs and claw-free graphs
Zhiquan Hu
,
Feng Tian
,
Bing Wei
Journal of Graph Theory
50
(2), 2005, pp. 130-141
A generalization of a Ramsey-type theorem on hypermatchings
Paul Baginski
Journal of Graph Theory
50
(2), 2005, pp. 142-149
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs
Henning Bruhn
,
Reinhard Diestel
,
Maya Stein
Journal of Graph Theory
50
(2), 2005, pp. 150-161
On graphs whose Laplacian matrices have distinct integer eigenvalues
Shaun M. Fallat
,
Stephen J. Kirkland
,
Jason J. Molitierno
,
M. Neumann
Journal of Graph Theory
50
(2), 2005, pp. 162-174
Linear Ramsey numbers of sparse graphs
Lingsheng Shi
Journal of Graph Theory
50
(3), 2005, pp. 175-185
Crossing numbers of Sierpiński-like graphs
Sandi Klavz̑ar
,
Bojan Mohar
Journal of Graph Theory
50
(3), 2005, pp. 186-198
Menger's theorem for infinite graphs with ends
Henning Bruhn
,
Reinhard Diestel
,
Maya Stein
Journal of Graph Theory
50
(3), 2005, pp. 199-211
The number of pancyclic arcs in a
k
-strong tournament
Anders Yeo
Journal of Graph Theory
50
(3), 2005, pp. 212-219
On structural descriptions of lower ideals of trees
Yared Nigussie
,
Neil Robertson
Journal of Graph Theory
50
(3), 2005, pp. 220-233
Two maps with large representativity on one surface
R. Bruce Richter
,
Gelasio Salazar
Journal of Graph Theory
50
(3), 2005, pp. 234-245
Edge disjoint cycles through specified vertices
Luis Goddyn
,
Ladislav Stacho
Journal of Graph Theory
50
(3), 2005, pp. 246-260
Erratum to: ''Factorizations and characterizations of induced-hereditary and compositive properties''
Alastair Farrugia
,
Peter Mihók
,
R. Bruce Richter
,
Gabriel Semanis̑in
Journal of Graph Theory
50
(3), 2005, pp. 261-261
Anti-magic graphs via the combinatorial Nullstellensatz
Dan Hefetz
Journal of Graph Theory
50
(4), 2005, pp. 263-272
Nordhaus-Gaddum-type theorems for decompositions into many parts
Zoltan Füredi
,
Alexandr V. Kostochka
,
Riste S̑krekovski
,
Michael Stiebitz
,
Douglas B. West
Journal of Graph Theory
50
(4), 2005, pp. 273-292
Minimum vertex-diameter-2-critical graphs
Ya-Chen Chen
,
Zoltán Füredi
Journal of Graph Theory
50
(4), 2005, pp. 293-315
Some 3-connected 4-edge-critical non-Hamiltonian graphs
Yang Yuansheng
,
Zhao Chengye
,
Lin Xiaohui
,
Jiang Yongsong
,
Hao Xin
Journal of Graph Theory
50
(4), 2005, pp. 316-320
Seiten 1
2
3
>