Sous-graphes traçables des graphes infinis. - Norbert Polat (Discret. Math., 1982)

Couplages et transversaux généralisés d'un hypergraphe infini. - Norbert Polat (J. Comb. Theory B, 1982)

Sur une Extension du Théorème de Menger aux Graphes Infinis. - Norbert Polat (Eur. J. Comb., 1983)

A compactness result for perfect matchings. - Norbert Polat (Discret. Math., 1987)

A compactness theorem for perfect matchings in matroids. - Péter Komjáth; E. C. Milner; Norbert Polat (J. Comb. Theory B, 1988)

On the existence of minimal end-separators. - Norbert Polat (Discret. Math., 1990)

Asymmetrization of infinite trees. - Norbert Polat (Discret. Math., 1991)

Asymmetrising sets in trees. - Norbert Polat; Gert Sabidussi (Discret. Math., 1991)

A mengerian theorem for infinite graphs with ideal points. - Norbert Polat (J. Comb. Theory B, 1991)

A minimax theorem for infinite graphs with ideal points. - Norbert Polat (Discret. Math., 1992)

Similarity and asymmetrization of trees. - Norbert Polat (Discret. Math., 1992)

Minimax theorems for infinite graphs with the ends as ideal points. - Norbert Polat (Discret. Math., 1994)

Fixed elements of infinite trees. - Norbert Polat; Gert Sabidussi (Discret. Math., 1994)

A Helly theorem for geodesic convexity in strongly dismantlable graphs. - Norbert Polat (Discret. Math., 1995)

Retract-collapsible graphs and invariant subgraph properties. - Norbert Polat (J. Graph Theory, 1995)

Invariant Hamming graphs in infinite quasi-median graphs. - Marc Chastand; Norbert Polat (Discret. Math., 1996)

Stable graphs for a family of endomorphisms. - Norbert Polat (Discret. Math., 1996)

Finite invariant sets in infinite graphs. - Norbert Polat (Discret. Math., 1996)

Ends and Multi-endings, II. - Norbert Polat (J. Comb. Theory, Ser. B, 1996)

Ends and Multi-Endings, I. - Norbert Polat (J. Comb. Theory B, 1996)

Colorings of infinite graphs without one-colored rays. - Norbert Polat (J. Graph Theory, 1996)

End-faithful spanning trees in T1-free graphs. - Norbert Polat (J. Graph Theory, 1997)

Graphs without isometric rays and invariant subgraph properties, I. - Norbert Polat (J. Graph Theory, 1998)

Spanning trees of countable graphs omitting sets of dominated ends. - François Laviolette; Norbert Polat (Discret. Math., 1999)

Invariant subgraph properties in pseudo-modular graphs. - Norbert Polat (Discret. Math., 1999)

On constructible graphs, infinite bridged graphs and weakly cop-win graphs. - Marc Chastand; François Laviolette; Norbert Polat (Discret. Math., 2000)

On infinite bridged graphs and strongly dismantlable graphs. - Norbert Polat (Discret. Math., 2000)

Convexity and fixed-point properties in Helly graphs. - Norbert Polat (Discret. Math., 2001)

On isometric subgraphs of infinite bridged graphs and geodesic convexity. - Norbert Polat (Discret. Math., 2002)

Reconstruction of infinite locally finite connected graphs. - Marc Chastand; Norbert Polat (Discret. Math., 2003)

On dually compact closed classes of graphs and BFS-constructible graphs. - Norbert Polat (Discuss. Math. Graph Theory, 2003)

On constructible graphs, locally Helly graphs, and convexity. - Norbert Polat (J. Graph Theory, 2003)

Fixed finite subgraph theorems in infinite weakly modular graphs. - Norbert Polat (Discret. Math., 2004)

alpha-Extendable paths in infinite graphs. - Norbert Polat (Discret. Math., 2005)

On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs. - Marc Chastand; Norbert Polat (Discret. Math., 2006)

On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays. - Marc Chastand; Norbert Polat (Discret. Math., 2006)

Netlike partial cubes I. General properties. - Norbert Polat (Discret. Math., 2007)

Netlike partial cubes II. Retracts and netlike subgraphs. - Norbert Polat (Discret. Math., 2009)

Netlike partial cubes III. The median cycle property. - Norbert Polat (Discret. Math., 2009)

Netlike partial cubes, V: Completion and netlike classes. - Norbert Polat (Discret. Math., 2009)

Netlike partial cubes, IV: Fixed finite subgraph theorems. - Norbert Polat (Eur. J. Comb., 2009)

On the geodesic pre-hull number of a graph. - Norbert Polat; Gert Sabidussi (Eur. J. Comb., 2009)

Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity. - Norbert Polat (Discret. Math., 2012)

Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes. - Norbert Polat (Discret. Math., 2012)

On some characterizations of antipodal partial cubes. - Norbert Polat (Discuss. Math. Graph Theory, 2019)

On some properties of antipodal partial cubes. - Norbert Polat (Discuss. Math. Graph Theory, 2020)

On antipodal and diametrical partial cubes. - Norbert Polat (Discuss. Math. Graph Theory, 2021)

A cop-winning strategy on strongly cop-win graphs. - Josée Desharnais; François Laviolette; Héli Marcoux; Norbert Polat (Discret. Math., 2023)