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 Volume=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Chords of longest circuits of graphs embedded in torus and Klein bottle
Xuechao Li
,
Cun-Quan Zhang
Journal of Graph Theory
43
(1), 2003, pp. 1-23
Tree-width and circumference of graphs
Etienne Birmele
Journal of Graph Theory
43
(1), 2003, pp. 24-25
2-connected 7-coverings of 3-connected graphs on surfaces
Ken-ichi Kawarabayashi
,
Atsuhiro Nakamoto
,
Katsuhiro Ota
Journal of Graph Theory
43
(1), 2003, pp. 26-36
Contractibility techniques as a closure concept
Zdenȇk Ryjác̑ek
,
R.H. Schelp
Journal of Graph Theory
43
(1), 2003, pp. 37-48
Maximal sets of Hamilton cycles in complete multipartite graphs
Mike Daven
,
J.A. MacDougall
,
C.A. Rodger
Journal of Graph Theory
43
(1), 2003, pp. 49-66
Highly edge-connected detachments of graphs and digraphs
Alex R. Berg
,
Bill Jackson
,
Tobor Jordán
Journal of Graph Theory
43
(1), 2003, pp. 67-77
Fold-2-covering triangular embeddings
D. Bénard
,
A. Bouchet
,
R.B. Richter
Journal of Graph Theory
43
(2), 2003, pp. 79-92
A theorem on integer flows on Cartesian products of graphs
Wilfried Imrich
,
Riste S̑krekovski
Journal of Graph Theory
43
(2), 2003, pp. 93-98
Large families of mutually embeddable vertex-transitive graphs
Anthony Bonato
,
Claude Tardif
Journal of Graph Theory
43
(2), 2003, pp. 99-106
Circular colorings of edge-weighted graphs
Bojan Mohar
Journal of Graph Theory
43
(2), 2003, pp. 107-116
On vertex critical graphs with prescribed diameter
L. Caccetta
,
S. EL-Batanouny
,
J. Huang
Journal of Graph Theory
43
(2), 2003, pp. 117-131
An algorithm for finding factorizations of complete graphs
A.J.W. Hilton
,
Matthew Johnson
Journal of Graph Theory
43
(2), 2003, pp. 132-136
Line graphs of bipartite graphs with Hamiltonian paths
Francis K. Bell
Journal of Graph Theory
43
(2), 2003, pp. 137-149
Minimum cycle bases of Halin graphs
Peter F. Stadler
Journal of Graph Theory
43
(2), 2003, pp. 150-155
NP
completeness of the edge precoloring extension problem on bipartite graphs
Jiȓí Fiala
Journal of Graph Theory
43
(2), 2003, pp. 156-160
Isometric cycles, cutsets, and crowning of bridged graphs
Tao Jiang
,
Seog-Jin Kim
,
Douglas B. West
Journal of Graph Theory
43
(3), 2003, pp. 161-170
On moore bipartite digraphs
M.A. Fiol
,
J. Gimbert
,
J. Gómez
,
Y. Wu
Journal of Graph Theory
43
(3), 2003, pp. 171-187
Two-factors each component of which contains a specified vertex
Yoshimi Egawa
,
Hikoe Enomoto
,
Ralph J. Faudree
,
Hao Li
,
Ingo Schiermeyer
Journal of Graph Theory
43
(3), 2003, pp. 188-198
A newly recognized intrinsically knotted graph
Joel Foisy
Journal of Graph Theory
43
(3), 2003, pp. 199-209
Maximal
\sigma
-polynomials of connected 3-chromatic graphs
Ioan Tomescu
Journal of Graph Theory
43
(3), 2003, pp. 210-222
The structure of saturated critical blocks
Donald A. Nelson
Journal of Graph Theory
43
(3), 2003, pp. 223-237
Induced subgraphs of prescribed size
Noga Alon
,
Michael Krivelevich
,
Benny Sudakov
Journal of Graph Theory
43
(4), 2003, pp. 239-251
Off-diagonal and asymptotic results on the Ramsey number
r(K_{2,m}, K_{2,n})
Roland Lortz
,
Ingrid Mengersen
Journal of Graph Theory
43
(4), 2003, pp. 252-268
A 2-factor with two components of a graph satisfying the Chvátal-Erd\Hos condition
Atsushi Kaneko
,
Kiyoshi Yoshimoto
Journal of Graph Theory
43
(4), 2003, pp. 269-279
On constructible graphs, locally Helly graphs, and convexity
Norbert Polat
Journal of Graph Theory
43
(4), 2003, pp. 280-298
Seiten 1
2
>