We stand with Ukraine  

Norbert Polat

According to our database1, Norbert Polat authored at least 48 papers between 1982 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A cop-winning strategy on strongly cop-win graphs.
[BibTeX]
[DOI]
Josée Desharnais
,
François Laviolette
,
Héli Marcoux
,
Norbert Polat
Discret. Math., August, 2023

2021
On antipodal and diametrical partial cubes.
[BibTeX]
[DOI]
Norbert Polat
Discuss. Math. Graph Theory, 2021

2020
On some properties of antipodal partial cubes.
[BibTeX]
[DOI]
Norbert Polat
Discuss. Math. Graph Theory, 2020

2019
On some characterizations of antipodal partial cubes.
[BibTeX]
[DOI]
Norbert Polat
Discuss. Math. Graph Theory, 2019

2012
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2012

Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2012

2009
On the geodesic pre-hull number of a graph.
[BibTeX]
[DOI]
Norbert Polat
,
Gert Sabidussi
Eur. J. Comb., 2009

Netlike partial cubes, IV: Fixed finite subgraph theorems.
[BibTeX]
[DOI]
Norbert Polat
Eur. J. Comb., 2009

Netlike partial cubes, V: Completion and netlike classes.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2009

Netlike partial cubes III. The median cycle property.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2009

Netlike partial cubes II. Retracts and netlike subgraphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2009

2007
Netlike partial cubes I. General properties.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2007

2006
On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays.
[BibTeX]
[DOI]
Marc Chastand
,
Norbert Polat
Discret. Math., 2006

On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs.
[BibTeX]
[DOI]
Marc Chastand
,
Norbert Polat
Discret. Math., 2006

2005
alpha-Extendable paths in infinite graphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2005

2004
Fixed finite subgraph theorems in infinite weakly modular graphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2004

2003
On constructible graphs, locally Helly graphs, and convexity.
[BibTeX]
[DOI]
Norbert Polat
J. Graph Theory, 2003

On dually compact closed classes of graphs and BFS-constructible graphs.
[BibTeX]
[DOI]
Norbert Polat
Discuss. Math. Graph Theory, 2003

Reconstruction of infinite locally finite connected graphs.
[BibTeX]
[DOI]
Marc Chastand
,
Norbert Polat
Discret. Math., 2003

2002
On isometric subgraphs of infinite bridged graphs and geodesic convexity.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2002

2001
Convexity and fixed-point properties in Helly graphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2001

2000
On infinite bridged graphs and strongly dismantlable graphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 2000

On constructible graphs, infinite bridged graphs and weakly cop-win graphs.
[BibTeX]
[DOI]
Marc Chastand
,
François Laviolette
,
Norbert Polat
Discret. Math., 2000

1999
Invariant subgraph properties in pseudo-modular graphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1999

Spanning trees of countable graphs omitting sets of dominated ends.
[BibTeX]
[DOI]
François Laviolette
,
Norbert Polat
Discret. Math., 1999

1998
Graphs without isometric rays and invariant subgraph properties, I.
[BibTeX]
[DOI]
Norbert Polat
J. Graph Theory, 1998

1997
End-faithful spanning trees in <i>T</i><sub>1</sub>-free graphs.
[BibTeX]
[DOI]
Norbert Polat
J. Graph Theory, 1997

1996
Colorings of infinite graphs without one-colored rays.
[BibTeX]
[DOI]
Norbert Polat
J. Graph Theory, 1996

Ends and Multi-Endings, I.
[BibTeX]
[DOI]
Norbert Polat
J. Comb. Theory B, 1996

Ends and Multi-endings, II.
[BibTeX]
[DOI]
Norbert Polat
J. Comb. Theory, Ser. B, 1996

Finite invariant sets in infinite graphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1996

Stable graphs for a family of endomorphisms.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1996

Invariant Hamming graphs in infinite quasi-median graphs.
[BibTeX]
[DOI]
Marc Chastand
,
Norbert Polat
Discret. Math., 1996

1995
Retract-collapsible graphs and invariant subgraph properties.
[BibTeX]
[DOI]
Norbert Polat
J. Graph Theory, 1995

A Helly theorem for geodesic convexity in strongly dismantlable graphs.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1995

1994
Fixed elements of infinite trees.
[BibTeX]
[DOI]
Norbert Polat
,
Gert Sabidussi
Discret. Math., 1994

Minimax theorems for infinite graphs with the ends as ideal points.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1994

1992
Similarity and asymmetrization of trees.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1992

A minimax theorem for infinite graphs with ideal points.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1992

1991
A mengerian theorem for infinite graphs with ideal points.
[BibTeX]
[DOI]
Norbert Polat
J. Comb. Theory B, 1991

Asymmetrising sets in trees.
[BibTeX]
[DOI]
Norbert Polat
,
Gert Sabidussi
Discret. Math., 1991

Asymmetrization of infinite trees.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1991

1990
On the existence of minimal end-separators.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1990

1988
A compactness theorem for perfect matchings in matroids.
[BibTeX]
[DOI]
Péter Komjáth
,
E. C. Milner
,
Norbert Polat
J. Comb. Theory B, 1988

1987
A compactness result for perfect matchings.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1987

1983
Sur une Extension du Théorème de Menger aux Graphes Infinis.
[BibTeX]
[DOI]
Norbert Polat
Eur. J. Comb., 1983

1982
Couplages et transversaux généralisés d'un hypergraphe infini.
[BibTeX]
[DOI]
Norbert Polat
J. Comb. Theory B, 1982

Sous-graphes traçables des graphes infinis.
[BibTeX]
[DOI]
Norbert Polat
Discret. Math., 1982


  Loading...