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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Open problems of Paul Erd\Hos in graph theory
F.R.K. Chung
Journal of Graph Theory
25
(1), 1997, pp. 3-36
Intersections of longest cycles in grid graphs
B. Menke
,
T. Zamfirescu
,
C. Zamfirescu
Journal of Graph Theory
25
(1), 1997, pp. 37-52
On the existence of countble universal graphs
Zoltán Füredi
,
Péter Komjáth
Journal of Graph Theory
25
(1), 1997, pp. 53-58
Decycling graphs
Lowell W. Beineke
,
Robert C. Vandell
Journal of Graph Theory
25
(1), 1997, pp. 59-77
Total interval number for graphs with bounded degree
Alexander V. Kostochka
,
Douglas B. West
Journal of Graph Theory
25
(1), 1997, pp. 79-84
Subdivisions, parity and well-covered graphs
Yair Caro
Journal of Graph Theory
25
(1), 1997, pp. 85-94
Mean distance and minimum degree
Mekkia Kouider
,
Peter Winkler
Journal of Graph Theory
25
(1), 1997, pp. 95-99
Dominating sets with small clique covering number
Stephen G. Penrice
Journal of Graph Theory
25
(2), 1997, pp. 101-105
Partition graphs for finite symmetric groups
Marston Conder
,
Margaret Morton
,
Cheryl E. Praeger
Journal of Graph Theory
25
(2), 1997, pp. 107-117
Pebbling in diameter two graphs and products of paths
T.A. Clarke
,
R.A. Hochberg
,
G.H. Hurlbert
Journal of Graph Theory
25
(2), 1997, pp. 119-128
A short proof of Kuratowski's graph planarity criterion
Yury Makarychev
Journal of Graph Theory
25
(2), 1997, pp. 129-131
A
\frac{1}{2}
-transitive graph of valency 4 with a nonsolvable group of automorphisms
Dragan Marus̑ic̑
,
Ming-Yao Xu
Journal of Graph Theory
25
(2), 1997, pp. 133-138
Bounds related to domination in graphs with minimum degree two
Laura A. Sanchis
Journal of Graph Theory
25
(2), 1997, pp. 139-152
Minimal embeddings in the projective plane
Scott P. Randby
Journal of Graph Theory
25
(2), 1997, pp. 153-163
A counterexample to the bold conjecture
Tadashi Sakuma
Journal of Graph Theory
25
(2), 1997, pp. 165-168
Packing almost stars into the complete graph
Edward Dobson
Journal of Graph Theory
25
(2), 1997, pp. 169-172
Independence and Hamiltonicity in 3-domination-critical graphs
Odile Favaron
,
Feng Tian
,
Lei Zhang
Journal of Graph Theory
25
(3), 1997, pp. 173-184
Star partitions of graphs
Y. Egawa
,
M. Kano
,
Alexander K. Kelmans
Journal of Graph Theory
25
(3), 1997, pp. 185-190
The chromatic number of oriented graphs
Eric Sopena
Journal of Graph Theory
25
(3), 1997, pp. 191-205
Coloring precolored perfect graphs
Jan Kratochvíl
,
András Sebŏ
Journal of Graph Theory
25
(3), 1997, pp. 207-215
Hamiltonian
k
-factors in graphs
Bing Wei
,
Yongjin Zhu
Journal of Graph Theory
25
(3), 1997, pp. 217-227
Minimum cycle covers of graphs
Genghua Fan
Journal of Graph Theory
25
(3), 1997, pp. 229-242
On line graphs of linear 3-uniform hypergraphs
Yury Metelsky
,
Regina Tyshkevich
Journal of Graph Theory
25
(4), 1997, pp. 243-251
Degree sums for edges and cycle lengths in graphs
Stephan Brandt
,
Henk Jan Veldman
Journal of Graph Theory
25
(4), 1997, pp. 253-256
Avoiding multiple entry arrays
Amanda G. Chetwynd
,
Susan J. Rhodes
Journal of Graph Theory
25
(4), 1997, pp. 257-266
Seiten 1
2
>