default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorbert Polat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j48]Josée Desharnais
, François Laviolette, Héli Marcoux, Norbert Polat:
A cop-winning strategy on strongly cop-win graphs. Discret. Math. 346(8): 113419 (2023)- 2021
- [j47]Norbert Polat:
On antipodal and diametrical partial cubes. Discuss. Math. Graph Theory 41(4): 1127-1145 (2021) - 2020
- [j46]Norbert Polat:
On some properties of antipodal partial cubes. Discuss. Math. Graph Theory 40(3): 755-770 (2020)
2010 – 2019
- 2019
- [j45]Norbert Polat:
On some characterizations of antipodal partial cubes. Discuss. Math. Graph Theory 39(2): 439-453 (2019) - 2012
- [j44]Norbert Polat:
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity. Discret. Math. 312(1): 47-60 (2012) - [j43]Norbert Polat:
Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes. Discret. Math. 312(1): 61-73 (2012)
2000 – 2009
- 2009
- [j42]Norbert Polat:
Netlike partial cubes II. Retracts and netlike subgraphs. Discret. Math. 309(8): 1986-1998 (2009) - [j41]Norbert Polat:
Netlike partial cubes III. The median cycle property. Discret. Math. 309(8): 2119-2133 (2009) - [j40]Norbert Polat:
Netlike partial cubes, V: Completion and netlike classes. Discret. Math. 309(13): 4362-4376 (2009) - [j39]Norbert Polat:
Netlike partial cubes, IV: Fixed finite subgraph theorems. Eur. J. Comb. 30(5): 1194-1204 (2009) - [j38]Norbert Polat, Gert Sabidussi:
On the geodesic pre-hull number of a graph. Eur. J. Comb. 30(5): 1205-1220 (2009) - 2007
- [j37]Norbert Polat:
Netlike partial cubes I. General properties. Discret. Math. 307(22): 2704-2722 (2007) - 2006
- [j36]Marc Chastand, Norbert Polat:
On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs. Discret. Math. 306(13): 1272-1284 (2006) - [j35]Marc Chastand, Norbert Polat:
On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays. Discret. Math. 306(16): 1846-1861 (2006) - 2005
- [j34]Norbert Polat:
alpha-Extendable paths in infinite graphs. Discret. Math. 291(1-3): 175-189 (2005) - 2004
- [j33]Norbert Polat:
Fixed finite subgraph theorems in infinite weakly modular graphs. Discret. Math. 285(1-3): 239-256 (2004) - 2003
- [j32]Marc Chastand, Norbert Polat:
Reconstruction of infinite locally finite connected graphs. Discret. Math. 270(1-3): 60-97 (2003) - [j31]Norbert Polat:
On dually compact closed classes of graphs and BFS-constructible graphs. Discuss. Math. Graph Theory 23(2): 365-381 (2003) - [j30]Norbert Polat:
On constructible graphs, locally Helly graphs, and convexity. J. Graph Theory 43(4): 280-298 (2003) - 2002
- [j29]Norbert Polat:
On isometric subgraphs of infinite bridged graphs and geodesic convexity. Discret. Math. 244(1-3): 399-416 (2002) - 2001
- [j28]Norbert Polat:
Convexity and fixed-point properties in Helly graphs. Discret. Math. 229(1-3): 197-211 (2001) - 2000
- [j27]Norbert Polat:
On infinite bridged graphs and strongly dismantlable graphs. Discret. Math. 211: 153-166 (2000) - [j26]Marc Chastand, François Laviolette, Norbert Polat:
On constructible graphs, infinite bridged graphs and weakly cop-win graphs. Discret. Math. 224(1-3): 61-78 (2000)
1990 – 1999
- 1999
- [j25]François Laviolette, Norbert Polat:
Spanning trees of countable graphs omitting sets of dominated ends. Discret. Math. 194(1-3): 151-172 (1999) - [j24]Norbert Polat:
Invariant subgraph properties in pseudo-modular graphs. Discret. Math. 207(1-3): 199-217 (1999) - 1998
- [j23]Norbert Polat:
Graphs without isometric rays and invariant subgraph properties, I. J. Graph Theory 27(2): 99-109 (1998) - 1997
- [j22]Norbert Polat:
End-faithful spanning trees in T1-free graphs. J. Graph Theory 26(4): 175-181 (1997) - 1996
- [j21]Norbert Polat:
Stable graphs for a family of endomorphisms. Discret. Math. 150(1-3): 325-335 (1996) - [j20]Norbert Polat:
Finite invariant sets in infinite graphs. Discret. Math. 158(1-3): 211-221 (1996) - [j19]Marc Chastand, Norbert Polat:
Invariant Hamming graphs in infinite quasi-median graphs. Discret. Math. 160(1-3): 93-104 (1996) - [j18]Norbert Polat:
Ends and Multi-Endings, I. J. Comb. Theory B 67(1): 86-110 (1996) - [j17]Norbert Polat:
Ends and Multi-endings, II. J. Comb. Theory, Ser. B 68(1): 56-86 (1996) - [j16]Norbert Polat:
Colorings of infinite graphs without one-colored rays. J. Graph Theory 22(2): 189-201 (1996) - 1995
- [j15]Norbert Polat:
A Helly theorem for geodesic convexity in strongly dismantlable graphs. Discret. Math. 140(1-3): 119-127 (1995) - [j14]Norbert Polat:
Retract-collapsible graphs and invariant subgraph properties. J. Graph Theory 19(1): 25-44 (1995) - 1994
- [j13]Norbert Polat:
Minimax theorems for infinite graphs with the ends as ideal points. Discret. Math. 130(1-3): 89-96 (1994) - [j12]Norbert Polat, Gert Sabidussi:
Fixed elements of infinite trees. Discret. Math. 130(1-3): 97-102 (1994) - 1992
- [j11]Norbert Polat:
A minimax theorem for infinite graphs with ideal points. Discret. Math. 103(1): 57-65 (1992) - [j10]Norbert Polat:
Similarity and asymmetrization of trees. Discret. Math. 109(1-3): 221-238 (1992) - 1991
- [j9]Norbert Polat, Gert Sabidussi:
Asymmetrising sets in trees. Discret. Math. 95(1-3): 271-289 (1991) - [j8]Norbert Polat:
Asymmetrization of infinite trees. Discret. Math. 95(1-3): 291-301 (1991) - [j7]Norbert Polat:
A mengerian theorem for infinite graphs with ideal points. J. Comb. Theory B 51(2): 248-255 (1991) - 1990
- [j6]Norbert Polat:
On the existence of minimal end-separators. Discret. Math. 85(1): 97-98 (1990)
1980 – 1989
- 1988
- [j5]Péter Komjáth, E. C. Milner, Norbert Polat:
A compactness theorem for perfect matchings in matroids. J. Comb. Theory B 44(3): 253-262 (1988) - 1987
- [j4]Norbert Polat:
A compactness result for perfect matchings. Discret. Math. 64(2-3): 229-237 (1987) - 1983
- [j3]Norbert Polat:
Sur une Extension du Théorème de Menger aux Graphes Infinis. Eur. J. Comb. 4(4): 359-365 (1983) - 1982
- [j2]Norbert Polat:
Sous-graphes traçables des graphes infinis. Discret. Math. 38(2-3): 243-263 (1982) - [j1]Norbert Polat:
Couplages et transversaux généralisés d'un hypergraphe infini. J. Comb. Theory B 32(3): 293-315 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
