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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An isomorphic factorization of the complete graph
F.K. Hwang
Journal of Graph Theory
19
(3), 1995, pp. 333-337
Paths, cycles, and arc-connectivity in digraphs
Xiang-Ying Su
Journal of Graph Theory
19
(3), 1995, pp. 339-351
Competitive inheritance and limitedness of grpahs
Chi Wang
Journal of Graph Theory
19
(3), 1995, pp. 353-366
Realization of digraphs by preferences based on distances in graphs
Weizhen Gu
,
K.B. Reid
,
Walter Schnyder
Journal of Graph Theory
19
(3), 1995, pp. 367-373
The edge reconstruction number of a disconnected graph
Robert Molina
Journal of Graph Theory
19
(3), 1995, pp. 375-384
The size of graphs without nowhere-zero 4-flows
Hong-Jian Lai
Journal of Graph Theory
19
(3), 1995, pp. 385-395
Generalized degree conditions for graphs with bounded independence number
Ralph Faudree
,
Ronald J. Gould
,
Linda Lesniak
,
Terri Lindquester
Journal of Graph Theory
19
(3), 1995, pp. 397-409
The fractional chromatic number of Mycielski's graphs
Michael Larsen
,
James Propp
,
Daniel Ullman
Journal of Graph Theory
19
(3), 1995, pp. 411-416
A polynomial time algorithm recognizing link trees
Peter Bugata
,
Attila Nagy
,
Roman Vávra
Journal of Graph Theory
19
(3), 1995, pp. 417-433
Enumeration of trees by inversions
Ira M. Gessel
,
Bruce E. Sagan
,
Yeong-Nan Yeh
Journal of Graph Theory
19
(4), 1995, pp. 435-459
The 2-intersection number of paths and bounded-degree trees
Michael S. Jacobson
,
André E. Kézdy
,
Douglas B. West
Journal of Graph Theory
19
(4), 1995, pp. 461-469
Oriented Hamilton cycles in digraphs
Roland Häggkvist
,
Andrew Thomason
Journal of Graph Theory
19
(4), 1995, pp. 471-479
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: A survey
G. Gutin
Journal of Graph Theory
19
(4), 1995, pp. 481-505
A new proof of the 6 color theorem
Oleg V. Borodin
Journal of Graph Theory
19
(4), 1995, pp. 507-521
Graphs with least number of colorings
A. Sakaloglu
,
A. Satyanarayana
Journal of Graph Theory
19
(4), 1995, pp. 523-533
On the existence of special depth first search trees
Ephraim Korach
,
Zvi Ostfeld
Journal of Graph Theory
19
(4), 1995, pp. 535-547
Some results on the reconstruction problems -
p
-claw-free, chordal, and
P_4
-reducible graphs
Bhalchandra D. Thatte
Journal of Graph Theory
19
(4), 1995, pp. 549-561
Seiten
<
1
2
3
4