Norbert Polat

48 papers Journal 48
YearRankTypeTitle / Venue / Authors
2023 J jnl
A cop-winning strategy on strongly cop-win graphs.
Discret. Math.
Josée Desharnais, François Laviolette, Héli Marcoux, Norbert Polat
2021 J jnl
On antipodal and diametrical partial cubes.
Discuss. Math. Graph Theory
Norbert Polat
2020 J jnl
On some properties of antipodal partial cubes.
Discuss. Math. Graph Theory
Norbert Polat
2019 J jnl
On some characterizations of antipodal partial cubes.
Discuss. Math. Graph Theory
Norbert Polat
2012 J jnl
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity.
Discret. Math.
Norbert Polat
2012 J jnl
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes.
Discret. Math.
Norbert Polat
2009 J jnl
Netlike partial cubes II. Retracts and netlike subgraphs.
Discret. Math.
Norbert Polat
2009 J jnl
Netlike partial cubes III. The median cycle property.
Discret. Math.
Norbert Polat
2009 J jnl
Netlike partial cubes, IV: Fixed finite subgraph theorems.
Eur. J. Comb.
Norbert Polat
2009 J jnl
Netlike partial cubes, V: Completion and netlike classes.
Discret. Math.
Norbert Polat
2009 J jnl
On the geodesic pre-hull number of a graph.
Eur. J. Comb.
Norbert Polat, Gert Sabidussi
2007 J jnl
Netlike partial cubes I. General properties.
Discret. Math.
Norbert Polat
2006 J jnl
On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays.
Discret. Math.
Marc Chastand, Norbert Polat
2006 J jnl
On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs.
Discret. Math.
Marc Chastand, Norbert Polat
2005 J jnl
alpha-Extendable paths in infinite graphs.
Discret. Math.
Norbert Polat
2004 J jnl
Fixed finite subgraph theorems in infinite weakly modular graphs.
Discret. Math.
Norbert Polat
2003 J jnl
On constructible graphs, locally Helly graphs, and convexity.
J. Graph Theory
Norbert Polat
2003 J jnl
On dually compact closed classes of graphs and BFS-constructible graphs.
Discuss. Math. Graph Theory
Norbert Polat
2003 J jnl
Reconstruction of infinite locally finite connected graphs.
Discret. Math.
Marc Chastand, Norbert Polat
2002 J jnl
On isometric subgraphs of infinite bridged graphs and geodesic convexity.
Discret. Math.
Norbert Polat
2001 J jnl
Convexity and fixed-point properties in Helly graphs.
Discret. Math.
Norbert Polat
2000 J jnl
On constructible graphs, infinite bridged graphs and weakly cop-win graphs.
Discret. Math.
Marc Chastand, François Laviolette, Norbert Polat
2000 J jnl
On infinite bridged graphs and strongly dismantlable graphs.
Discret. Math.
Norbert Polat
1999 J jnl
Invariant subgraph properties in pseudo-modular graphs.
Discret. Math.
Norbert Polat
1999 J jnl
Spanning trees of countable graphs omitting sets of dominated ends.
Discret. Math.
François Laviolette, Norbert Polat
1998 J jnl
Graphs without isometric rays and invariant subgraph properties, I.
J. Graph Theory
Norbert Polat
1997 J jnl
End-faithful spanning trees in
J. Graph Theory
Norbert Polat
1996 J jnl
Colorings of infinite graphs without one-colored rays.
J. Graph Theory
Norbert Polat
1996 J jnl
Ends and Multi-Endings, I.
J. Comb. Theory B
Norbert Polat
1996 J jnl
Ends and Multi-endings, II.
J. Comb. Theory, Ser. B
Norbert Polat
1996 J jnl
Finite invariant sets in infinite graphs.
Discret. Math.
Norbert Polat
1996 J jnl
Invariant Hamming graphs in infinite quasi-median graphs.
Discret. Math.
Marc Chastand, Norbert Polat
1996 J jnl
Stable graphs for a family of endomorphisms.
Discret. Math.
Norbert Polat
1995 J jnl
A Helly theorem for geodesic convexity in strongly dismantlable graphs.
Discret. Math.
Norbert Polat
1995 J jnl
Retract-collapsible graphs and invariant subgraph properties.
J. Graph Theory
Norbert Polat
1994 J jnl
Fixed elements of infinite trees.
Discret. Math.
Norbert Polat, Gert Sabidussi
1994 J jnl
Minimax theorems for infinite graphs with the ends as ideal points.
Discret. Math.
Norbert Polat
1992 J jnl
A minimax theorem for infinite graphs with ideal points.
Discret. Math.
Norbert Polat
1992 J jnl
Similarity and asymmetrization of trees.
Discret. Math.
Norbert Polat
1991 J jnl
A mengerian theorem for infinite graphs with ideal points.
J. Comb. Theory B
Norbert Polat
1991 J jnl
Asymmetrising sets in trees.
Discret. Math.
Norbert Polat, Gert Sabidussi
1991 J jnl
Asymmetrization of infinite trees.
Discret. Math.
Norbert Polat
1990 J jnl
On the existence of minimal end-separators.
Discret. Math.
Norbert Polat
1988 J jnl
A compactness theorem for perfect matchings in matroids.
J. Comb. Theory B
Péter Komjáth, E. C. Milner, Norbert Polat
1987 J jnl
A compactness result for perfect matchings.
Discret. Math.
Norbert Polat
1983 J jnl
Sur une Extension du Théorème de Menger aux Graphes Infinis.
Eur. J. Comb.
Norbert Polat
1982 J jnl
Couplages et transversaux généralisés d'un hypergraphe infini.
J. Comb. Theory B
Norbert Polat
1982 J jnl
Sous-graphes traçables des graphes infinis.
Discret. Math.
Norbert Polat