Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Norbert Polat
2010 – today
- 2012
[j43]Norbert Polat: Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity. Discrete Mathematics 312(1): 47-60 (2012)- [j42]Norbert Polat: Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes. Discrete Mathematics 312(1): 61-73 (2012)
2000 – 2009
- 2009
- [j41]Norbert Polat: Netlike partial cubes II. Retracts and netlike subgraphs. Discrete Mathematics 309(8): 1986-1998 (2009)
- [j40]Norbert Polat: Netlike partial cubes III. The median cycle property. Discrete Mathematics 309(8): 2119-2133 (2009)
- [j39]Norbert Polat: Netlike partial cubes, V: Completion and netlike classes. Discrete Mathematics 309(13): 4362-4376 (2009)
- [j38]Norbert Polat: Netlike partial cubes, IV: Fixed finite subgraph theorems. Eur. J. Comb. 30(5): 1194-1204 (2009)
- [j37]Norbert Polat, Gert Sabidussi: On the geodesic pre-hull number of a graph. Eur. J. Comb. 30(5): 1205-1220 (2009)
- 2007
- [j36]Norbert Polat: Netlike partial cubes I. General properties. Discrete Mathematics 307(22): 2704-2722 (2007)
- 2006
- [j35]Marc Chastand, Norbert Polat: On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs. Discrete Mathematics 306(13): 1272-1284 (2006)
- [j34]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
- [j33]Norbert Polat: alpha-Extendable paths in infinite graphs. Discrete Mathematics 291(1-3): 175-189 (2005)
- 2004
- [j32]Norbert Polat: Fixed finite subgraph theorems in infinite weakly modular graphs. Discrete Mathematics 285(1-3): 239-256 (2004)
- 2003
- [j31]Marc Chastand, Norbert Polat: Reconstruction of infinite locally finite connected graphs. Discrete Mathematics 270(1-3): 60-97 (2003)
- [j30]Norbert Polat: On dually compact closed classes of graphs and BFS-constructible graphs. Discussiones Mathematicae Graph Theory 23(2): 365-381 (2003)
- [j29]Norbert Polat: On constructible graphs, locally Helly graphs, and convexity. Journal of Graph Theory 43(4): 280-298 (2003)
- 2002
- [j28]Norbert Polat: On isometric subgraphs of infinite bridged graphs and geodesic convexity. Discrete Mathematics 244(1-3): 399-416 (2002)
- 2001
- [j27]Norbert Polat: Convexity and fixed-point properties in Helly graphs. Discrete Mathematics 229(1-3): 197-211 (2001)
- 2000
- [j26]Norbert Polat: On infinite bridged graphs and strongly dismantlable graphs. Discrete Mathematics 211: 153-166 (2000)
- [j25]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)
1990 – 1999
- 1999
- [j24]François Laviolette, Norbert Polat: Spanning trees of countable graphs omitting sets of dominated ends. Discrete Mathematics 194(1-3): 151-172 (1999)
- [j23]Norbert Polat: Invariant subgraph properties in pseudo-modular graphs. Discrete Mathematics 207(1-3): 199-217 (1999)
- 1998
- [j22]Norbert Polat: Graphs without isometric rays and invariant subgraph properties, I. Journal of Graph Theory 27(2): 99-109 (1998)
- 1997
- [j21]Norbert Polat: End-faithful spanning trees in T1-free graphs. Journal of Graph Theory 26(4): 175-181 (1997)
- 1996
- [j20]Norbert Polat: Stable graphs for a family of endomorphisms. Discrete Mathematics 150(1-3): 325-335 (1996)
- [j19]Norbert Polat: Finite invariant sets in infinite graphs. Discrete Mathematics 158(1-3): 211-221 (1996)
- [j18]Marc Chastand, Norbert Polat: Invariant Hamming graphs in infinite quasi-median graphs. Discrete Mathematics 160(1-3): 93-104 (1996)
- [j17]
- [j16]
- [j15]Norbert Polat: Colorings of infinite graphs without one-colored rays. Journal of Graph Theory 22(2): 189-201 (1996)
- 1995
- [j14]Norbert Polat: A Helly theorem for geodesic convexity in strongly dismantlable graphs. Discrete Mathematics 140(1-3): 119-127 (1995)
- [j13]Norbert Polat: Retract-collapsible graphs and invariant subgraph properties. Journal of Graph Theory 19(1): 25-44 (1995)
- 1994
- [j12]Norbert Polat: Minimax theorems for infinite graphs with the ends as ideal points. Discrete Mathematics 130(1-3): 89-96 (1994)
- [j11]Norbert Polat, Gert Sabidussi: Fixed elements of infinite trees. Discrete Mathematics 130(1-3): 97-102 (1994)
- 1992
- [j10]Norbert Polat: A minimax theorem for infinite graphs with ideal points. Discrete Mathematics 103(1): 57-65 (1992)
- [j9]Norbert Polat: Similarity and asymmetrization of trees. Discrete Mathematics 109(1-3): 221-238 (1992)
- 1991
- [j8]Norbert Polat, Gert Sabidussi: Asymmetrising sets in trees. Discrete Mathematics 95(1-3): 271-289 (1991)
- [j7]
- [j6]Norbert Polat: A mengerian theorem for infinite graphs with ideal points. J. Comb. Theory, Ser. B 51(2): 248-255 (1991)
- 1990
- [j5]
1980 – 1989
- 1988
- [j4]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
- [j3]Norbert Polat: A compactness result for perfect matchings. Discrete Mathematics 64(2-3): 229-237 (1987)
- 1982
- [j2]Norbert Polat: Sous-graphes traçables des graphes infinis. Discrete Mathematics 38(2-3): 243-263 (1982)
- [j1]Norbert Polat: Couplages et transversaux généralisés d'un hypergraphe infini. J. Comb. Theory, Ser. B 32(3): 293-315 (1982)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-06 20:45 CEST by the dblp team