Norbert Polat

发表

A mengerian theorem for infinite graphs with ideal points

Norbert Polat, 1991, J. Comb. Theory, Ser. B.

Netlike partial cubes, IV: Fixed finite subgraph theorems

Norbert Polat, 2009, Eur. J. Comb..

Fixed elements of infinite trees

Norbert Polat, Gert Sabidussi, G. Sabidussi, 1994, Discret. Math..

A Helly theorem for geodesic convexity in strongly dismantlable graphs

Norbert Polat, 1995, Discret. Math..

alpha-Extendable paths in infinite graphs

Norbert Polat, 2005, Discret. Math..

Sous-graphes traçables des graphes infinis

Norbert Polat, Norbert Polat, 1982, Discret. Math..

On infinite bridged graphs and strongly dismantlable graphs

Norbert Polat, N. Polat, 2000, Discret. Math..

On the existence of minimal end-separators

Norbert Polat, 1990, Discret. Math..

Stable graphs for a family of endomorphisms

Norbert Polat, 1996, Discret. Math..

On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs

Norbert Polat, Marc Chastand, Marc Chastand, 2006, Discret. Math..

Finite invariant sets in infinite graphs

Norbert Polat, N. Polat, 1996, Discret. Math..

On dually compact closed classes of graphs and BFS-constructible graphs

Norbert Polat, 2003, Discuss. Math. Graph Theory.

On constructible graphs, locally Helly graphs, and convexity

Norbert Polat, 2003, J. Graph Theory.

On Some Characterizations of Antipodal Partial Cubes

Norbert Polat, 2019, Discuss. Math. Graph Theory.

On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays

Norbert Polat, Marc Chastand, 2006, Discret. Math..

Ends and Multi-Endings, I

Norbert Polat, 1996, J. Comb. Theory, Ser. B.

End-faithful spanning trees in T1-free graphs

Norbert Polat, 1997, J. Graph Theory.

Invariant Hamming graphs in infinite quasi-median graphs

Norbert Polat, Marc Chastand, Marc Chastand, 1996, Discret. Math..

Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity

Norbert Polat, 2012, Discret. Math..

Sur une Extension du Théorème de Menger aux Graphes Infinis

Norbert Polat, 1983, Eur. J. Comb..

A compactness result for perfect matchings

Norbert Polat, 1987, Discret. Math..

On Some Properties of Antipodal Partial Cubes

Norbert Polat, N. Polat, 2020, Discuss. Math. Graph Theory.

On isometric subgraphs of infinite bridged graphs and geodesic convexity

Norbert Polat, 2002, Discret. Math..

Convexity and fixed-point properties in Helly graphs

Norbert Polat, 2001, Discret. Math..

Fixed finite subgraph theorems in infinite weakly modular graphs

Norbert Polat, N. Polat, 2004, Discret. Math..

Colorings of infinite graphs without one-colored rays

Norbert Polat, 1996, J. Graph Theory.

A minimax theorem for infinite graphs with ideal points

Norbert Polat, 1992, Discret. Math..

Graphs without isometric rays and invariant subgraph properties, I

Norbert Polat, 1998, J. Graph Theory.

Netlike partial cubes I. General properties

Norbert Polat, N. Polat, 2007, Discret. Math..

Netlike partial cubes II. Retracts and netlike subgraphs

Norbert Polat, 2009, Discret. Math..

Retract-collapsible graphs and invariant subgraph properties

Norbert Polat, 1995, J. Graph Theory.

Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes

Norbert Polat, 2012, Discret. Math..

Netlike partial cubes III. The median cycle property

Norbert Polat, N. Polat, 2009, Discret. Math..

Ends and Multi-endings, II

Norbert Polat, N. Polat, 1996, J. Comb. Theory, Ser. B.

Couplages et transversaux généralisés d'un hypergraphe infini

Norbert Polat, 1982, J. Comb. Theory, Ser. B.

On constructible graphs, infinite bridged graphs and weakly cop-win graphs

François Laviolette, Norbert Polat, Marc Chastand, 2000, Discret. Math..

Similarity and asymmetrization of trees

Norbert Polat, 1992, Discret. Math..

Minimax theorems for infinite graphs with the ends as ideal points

Norbert Polat, 1994, Discret. Math..

Asymmetrising sets in trees

Norbert Polat, Gert Sabidussi, 1991, Discret. Math..

Netlike partial cubes, V: Completion and netlike classes

Norbert Polat, N. Polat, 2009, Discret. Math..

Spanning trees of countable graphs omitting sets of dominated ends

François Laviolette, Norbert Polat, 1999, Discret. Math..

On the geodesic pre-hull number of a graph

Norbert Polat, Gert Sabidussi, 2009, Eur. J. Comb..

Asymmetrization of infinite trees

Norbert Polat, 1991, Discret. Math..

Invariant subgraph properties in pseudo-modular graphs

Norbert Polat, 1999, Discret. Math..

Reconstruction of infinite locally finite connected graphs

Norbert Polat, Marc Chastand, Marc Chastand, 2003, Discret. Math..

A compactness theorem for perfect matchings in matroids

E. C. Milner, Péter Komjáth, Norbert Polat, 1988, J. Comb. Theory, Ser. B.

On Antipodal and Diametrical Partial Cubes

Norbert Polat, 2021, Discuss. Math. Graph Theory.

On bipartite graphs whose interval space is a closed join space

Norbert Polat, N. Polat, 2017 .

Finite Invariant Sets for a Family of Endomorphisms in Compact Graphs

Norbert Polat, 1997 .

Graphs without isometric rays and invariant subgraph properties, I

Norbert Polat, 1998 .

Translations and semi-translations in infinite graphs

Norbert Polat, N. Polat, 1999 .

Spanning trees of infinite graphs

Norbert Polat, 1991 .

On constructible graphs, locally Helly graphs, and convexity

Norbert Polat, 2003 .

On translations of double rays in graphs

Norbert Polat, Mark E. Watkins, 1995 .

Finite invariant simplices in infinite graphs

Norbert Polat, 1993 .