The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Norbert Polat: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  30. Netlike partial cubes I. General properties. [Citation Graph (, )][DBLP]


  31. Netlike partial cubes II. Retracts and netlike subgraphs. [Citation Graph (, )][DBLP]


  32. Netlike partial cubes III. The median cycle property. [Citation Graph (, )][DBLP]


  33. Netlike partial cubes, V: Completion and netlike classes. [Citation Graph (, )][DBLP]


  34. Netlike partial cubes, IV: Fixed finite subgraph theorems. [Citation Graph (, )][DBLP]


  35. On the geodesic pre-hull number of a graph. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002