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
[1]
Hilfe
Suche: Author="Polat, Norbert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On constructible graphs, locally Helly graphs, and convexity
Norbert Polat
Journal of Graph Theory
43
(4), 2003, pp. 280-298
Graphs without isometric rays and invariant subgraph properties, I
Norbert Polat
Journal of Graph Theory
27
(2), 1998, pp. 99-109
End-faithful spanning trees in
T_{\aleph1}
-free graphs
Norbert Polat
Journal of Graph Theory
26
(4), 1997, pp. 175-181
Ends and multi-endings, I
Norbert Polat
Journal of Combinatorial Theory Series B
67
(1), 1996, pp. 86-110
Ends and Multi-endings, II
Norbert Polat
Journal of Combinatorial Theory Series B
68
(1), 1996, pp. 56-86
Colorings of infinite graphs without one-colored rays
Norbert Polat
Journal of Graph Theory
22
(2), 1996, pp. 189-201
Retract-collapsible graphs and invariant subgraph properties
Norbert Polat
Journal of Graph Theory
19
(1), 1995, pp. 25-44
A Mengerian theorem for infinite graphs with ideal points
Norbert Polat
Journal of Combinatorial Theory Series B
51
, 1991, pp. 248-255
Couplages et transversaux généralisés d'un hypergraphe infini
Norbert Polat
Journal of Combinatorial Theory Series B
32
, 1982, pp. 293-315