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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Induced embeddings in Steinhaus graphs
Franz A. Delahan
Journal of Graph Theory
29
(1), 1998, pp. 1-9
Note on graphs without repeated cycle lengths
Guantao Chen
,
Jenö Lehel
,
Michael S. Jacobson
,
Warren E. Shreve
Journal of Graph Theory
29
(1), 1998, pp. 11-15
Tearing a strip off the plane
Bruce L. Bauslaugh
Journal of Graph Theory
29
(1), 1998, pp. 17-33
Connectivity and separating sets of cages
Tao Jiang
,
Dhruv Mubayi
Journal of Graph Theory
29
(1), 1998, pp. 35-44
Hamiltonian decompositions of strong products
Cong Fan
,
Jiuqiang Liu
Journal of Graph Theory
29
(1), 1998, pp. 45-55
Random walks and the regeneration time
Andrew Beveridge
,
László Lovász
Journal of Graph Theory
29
(2), 1998, pp. 57-62
The smallest degree sum that yields potentially
P_k
-graphical sequences
Li Jiong-Sheng
,
Song Zi-Xia
Journal of Graph Theory
29
(2), 1998, pp. 63-72
Matching graphs
Linda Eroh
,
Michelle Schultz
Journal of Graph Theory
29
(2), 1998, pp. 73-86
König's edge coloring theorem without augmenting paths
Romeo Rizzi
Journal of Graph Theory
29
(2), 1998, pp. 87-87
Oriented walk double covering and bidirectional double tracing
Fan Hongbing
,
Xuding Zhu
Journal of Graph Theory
29
(2), 1998, pp. 89-102
The domination and competition graphs of a tournament
David C. Fisher
,
J. Richard Lundgren
,
Sarah K. Merz
,
K.B. Reid
Journal of Graph Theory
29
(2), 1998, pp. 103-110
A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
Jrgen Bang-Jensen
,
Gregory Gutin
,
Anders Yeo
Journal of Graph Theory
29
(2), 1998, pp. 111-132
A sufficient condition for bipartite graphs to be type one
Baogang Xu
Journal of Graph Theory
29
(3), 1998, pp. 133-137
The ratio of the irredundance number and the domination number for block-cactus graphs
V.E. Zverovich
Journal of Graph Theory
29
(3), 1998, pp. 139-149
The characterization of zero-sum
(\bmod 2)
bipartite Ramsey numbers
Yair Caro
,
Raphael Yuster
Journal of Graph Theory
29
(3), 1998, pp. 151-166
On the Pósa-Seymour conjecture
János Komlós
,
Gábor N. Sárközy
,
Endre Szemerédi
Journal of Graph Theory
29
(3), 1998, pp. 167-176
Long cycles passing through a specified path in a graph
Kazuhide Hirohata
Journal of Graph Theory
29
(3), 1998, pp. 177-184
Extremal graphs with bounded densities of small subgraphs
Jerrold R. Griggs
,
Miklós Simonovits
,
George Rubin Thomas
Journal of Graph Theory
29
(3), 1998, pp. 185-207
On minimal imperfect graphs with circular symmetry
Gábor Bacsó
,
Endre Boros
,
Vladimir Gurvich
,
Frédéric Maffray
,
Myriam Preissmann
Journal of Graph Theory
29
(4), 1998, pp. 209-225
Independence trees and Hamilton cycles
Hajo Broersma
,
Hilde Tuinstra
Journal of Graph Theory
29
(4), 1998, pp. 227-237
Irredundance perfect and
P_6
-free graphs
Joël Puech
Journal of Graph Theory
29
(4), 1998, pp. 239-255
A new upper bound for the harmonious chromatic number
Keith Edwards
Journal of Graph Theory
29
(4), 1998, pp. 257-261
Graph labeling and radio channel assignment
J. van den Heuvel
,
R.A. Leese
,
M.A. Shepherd
Journal of Graph Theory
29
(4), 1998, pp. 263-283
Hypothetical complexity of the nowhere-zero 5-flow problem
Martin Kochol
Journal of Graph Theory
28
(1), 1998, pp. 1-11
Hamiltonicity and reversing arcs in digraphs
William F. Klostermeyer
,
L̑ubomír S̑oltés
Journal of Graph Theory
28
(1), 1998, pp. 13-30
Seiten 1
2
3
>