| 2007 |
|---|
| 30 | EE | Norbert Polat:
Netlike partial cubes I. General properties.
Discrete Mathematics 307(22): 2704-2722 (2007) |
| 2006 |
|---|
| 29 | EE | Marc Chastand,
Norbert Polat:
On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs.
Discrete Mathematics 306(13): 1272-1284 (2006) |
| 28 | EE | Marc Chastand,
Norbert Polat:
On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays.
Discrete Mathematics 306(16): 1846-1861 (2006) |
| 2005 |
|---|
| 27 | EE | Norbert Polat:
alpha-Extendable paths in infinite graphs.
Discrete Mathematics 291(1-3): 175-189 (2005) |
| 2004 |
|---|
| 26 | EE | Norbert Polat:
Fixed finite subgraph theorems in infinite weakly modular graphs.
Discrete Mathematics 285(1-3): 239-256 (2004) |
| 2003 |
|---|
| 25 | EE | Marc Chastand,
Norbert Polat:
Reconstruction of infinite locally finite connected graphs.
Discrete Mathematics 270(1-3): 60-97 (2003) |
| 2002 |
|---|
| 24 | EE | Norbert Polat:
On isometric subgraphs of infinite bridged graphs and geodesic convexity.
Discrete Mathematics 244(1-3): 399-416 (2002) |
| 2001 |
|---|
| 23 | EE | Norbert Polat:
Convexity and fixed-point properties in Helly graphs.
Discrete Mathematics 229(1-3): 197-211 (2001) |
| 2000 |
|---|
| 22 | EE | Norbert Polat:
On infinite bridged graphs and strongly dismantlable graphs.
Discrete Mathematics 211: 153-166 (2000) |
| 21 | EE | Marc Chastand,
François Laviolette,
Norbert Polat:
On constructible graphs, infinite bridged graphs and weakly cop-win graphs.
Discrete Mathematics 224(1-3): 61-78 (2000) |
| 1999 |
|---|
| 20 | EE | François Laviolette,
Norbert Polat:
Spanning trees of countable graphs omitting sets of dominated ends.
Discrete Mathematics 194(1-3): 151-172 (1999) |
| 19 | EE | Norbert Polat:
Invariant subgraph properties in pseudo-modular graphs.
Discrete Mathematics 207(1-3): 199-217 (1999) |
| 1996 |
|---|
| 18 | EE | Norbert Polat:
Stable graphs for a family of endomorphisms.
Discrete Mathematics 150(1-3): 325-335 (1996) |
| 17 | EE | Norbert Polat:
Finite invariant sets in infinite graphs.
Discrete Mathematics 158(1-3): 211-221 (1996) |
| 16 | EE | Marc Chastand,
Norbert Polat:
Invariant Hamming graphs in infinite quasi-median graphs.
Discrete Mathematics 160(1-3): 93-104 (1996) |
| 15 | EE | Norbert Polat:
Ends and Multi-Endings, I.
J. Comb. Theory, Ser. B 67(1): 86-110 (1996) |
| 14 | EE | Norbert Polat:
Ends and Multi-endings, II.
J. Comb. Theory, Ser. B 68(1): 56-86 (1996) |
| 1995 |
|---|
| 13 | EE | Norbert Polat:
A Helly theorem for geodesic convexity in strongly dismantlable graphs.
Discrete Mathematics 140(1-3): 119-127 (1995) |
| 1994 |
|---|
| 12 | EE | Norbert Polat:
Minimax theorems for infinite graphs with the ends as ideal points.
Discrete Mathematics 130(1-3): 89-96 (1994) |
| 11 | EE | Norbert Polat,
Gert Sabidussi:
Fixed elements of infinite trees.
Discrete Mathematics 130(1-3): 97-102 (1994) |
| 1992 |
|---|
| 10 | EE | Norbert Polat:
A minimax theorem for infinite graphs with ideal points.
Discrete Mathematics 103(1): 57-65 (1992) |
| 9 | EE | Norbert Polat:
Similarity and asymmetrization of trees.
Discrete Mathematics 109(1-3): 221-238 (1992) |
| 1991 |
|---|
| 8 | EE | Norbert Polat,
Gert Sabidussi:
Asymmetrising sets in trees.
Discrete Mathematics 95(1-3): 271-289 (1991) |
| 7 | EE | Norbert Polat:
Asymmetrization of infinite trees.
Discrete Mathematics 95(1-3): 291-301 (1991) |
| 6 | EE | Norbert Polat:
A mengerian theorem for infinite graphs with ideal points.
J. Comb. Theory, Ser. B 51(2): 248-255 (1991) |
| 1990 |
|---|
| 5 | EE | Norbert Polat:
On the existence of minimal end-separators.
Discrete Mathematics 85(1): 97-98 (1990) |
| 1988 |
|---|
| 4 | EE | Péter Komjáth,
E. C. Milner,
Norbert Polat:
A compactness theorem for perfect matchings in matroids.
J. Comb. Theory, Ser. B 44(3): 253-262 (1988) |
| 1987 |
|---|
| 3 | EE | Norbert Polat:
A compactness result for perfect matchings.
Discrete Mathematics 64(2-3): 229-237 (1987) |
| 1982 |
|---|
| 2 | EE | Norbert Polat:
Sous-graphes traçables des graphes infinis.
Discrete Mathematics 38(2-3): 243-263 (1982) |
| 1 | EE | Norbert Polat:
Couplages et transversaux généralisés d'un hypergraphe infini.
J. Comb. Theory, Ser. B 32(3): 293-315 (1982) |
