Search results for "Norbert Polat"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Norbert Polat	Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes II. Fixed subgraph properties and infinite treelike partial cubes.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Norbert Polat	Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes I. Topologies and the geodesic convexity.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Norbert Polat	Netlike partial cubes II. Retracts and netlike subgraphs.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Norbert Polat	Netlike partial cubes III. The median cycle property.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Norbert Polat	Netlike partial cubes, V: Completion and netlike classes.	Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Norbert Polat	Netlike partial cubes, IV: Fixed finite subgraph theorems.	Eur. J. Comb.	2009	DBLP DOI BibTeX RDF
1	Norbert Polat, Gert Sabidussi	On the geodesic pre-hull number of a graph.	Eur. J. Comb.	2009	DBLP DOI BibTeX RDF
1	Norbert Polat	Netlike partial cubes I. General properties.	Discrete Mathematics	2007	DBLP DOI BibTeX RDF
1	Marc Chastand, Norbert Polat	On geodesic structures of weakly median graphs - II: Compactness, the role of isometric rays.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Marc Chastand, Norbert Polat	On geodesic structures of weakly median graphs I. Decomposition and octahedral graphs.	Discrete Mathematics	2006	DBLP DOI BibTeX RDF
1	Norbert Polat	alpha-Extendable paths in infinite graphs.	Discrete Mathematics	2005	DBLP DOI BibTeX RDF
1	Norbert Polat	Fixed finite subgraph theorems in infinite weakly modular graphs.	Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	Marc Chastand, Norbert Polat	Reconstruction of infinite locally finite connected graphs.	Discrete Mathematics	2003	DBLP DOI BibTeX RDF
1	Norbert Polat	On isometric subgraphs of infinite bridged graphs and geodesic convexity.	Discrete Mathematics	2002	DBLP DOI BibTeX RDF
1	Norbert Polat	Convexity and fixed-point properties in Helly graphs.	Discrete Mathematics	2001	DBLP DOI BibTeX RDF
1	Marc Chastand, François Laviolette, Norbert Polat	On constructible graphs, infinite bridged graphs and weakly cop-win graphs.	Discrete Mathematics	2000	DBLP DOI BibTeX RDF
1	Norbert Polat	On infinite bridged graphs and strongly dismantlable graphs.	Discrete Mathematics	2000	DBLP DOI BibTeX RDF
1	Norbert Polat	Invariant subgraph properties in pseudo-modular graphs.	Discrete Mathematics	1999	DBLP DOI BibTeX RDF
1	François Laviolette, Norbert Polat	Spanning trees of countable graphs omitting sets of dominated ends.	Discrete Mathematics	1999	DBLP DOI BibTeX RDF
1	Norbert Polat	Ends and Multi-endings, II.	J. Comb. Theory, Ser. B	1996	DBLP DOI BibTeX RDF
1	Norbert Polat	Ends and Multi-Endings, I.	J. Comb. Theory, Ser. B	1996	DBLP DOI BibTeX RDF
1	Marc Chastand, Norbert Polat	Invariant Hamming graphs in infinite quasi-median graphs.	Discrete Mathematics	1996	DBLP DOI BibTeX RDF
1	Norbert Polat	Stable graphs for a family of endomorphisms.	Discrete Mathematics	1996	DBLP DOI BibTeX RDF
1	Norbert Polat	Finite invariant sets in infinite graphs.	Discrete Mathematics	1996	DBLP DOI BibTeX RDF
1	Norbert Polat	A Helly theorem for geodesic convexity in strongly dismantlable graphs.	Discrete Mathematics	1995	DBLP DOI BibTeX RDF
1	Norbert Polat, Gert Sabidussi	Fixed elements of infinite trees.	Discrete Mathematics	1994	DBLP DOI BibTeX RDF
1	Norbert Polat	Minimax theorems for infinite graphs with the ends as ideal points.	Discrete Mathematics	1994	DBLP DOI BibTeX RDF
1	Norbert Polat	A minimax theorem for infinite graphs with ideal points.	Discrete Mathematics	1992	DBLP DOI BibTeX RDF
1	Norbert Polat	Similarity and asymmetrization of trees.	Discrete Mathematics	1992	DBLP DOI BibTeX RDF
1	Norbert Polat	A mengerian theorem for infinite graphs with ideal points.	J. Comb. Theory, Ser. B	1991	DBLP DOI BibTeX RDF
1	Norbert Polat, Gert Sabidussi	Asymmetrising sets in trees.	Discrete Mathematics	1991	DBLP DOI BibTeX RDF
1	Norbert Polat	Asymmetrization of infinite trees.	Discrete Mathematics	1991	DBLP DOI BibTeX RDF
1	Norbert Polat	On the existence of minimal end-separators.	Discrete Mathematics	1990	DBLP DOI BibTeX RDF
1	Péter Komjáth, E. C. Milner, Norbert Polat	A compactness theorem for perfect matchings in matroids.	J. Comb. Theory, Ser. B	1988	DBLP DOI BibTeX RDF
1	Norbert Polat	A compactness result for perfect matchings.	Discrete Mathematics	1987	DBLP DOI BibTeX RDF
1	Norbert Polat	Couplages et transversaux généralisés d'un hypergraphe infini.	J. Comb. Theory, Ser. B	1982	DBLP DOI BibTeX RDF
1	Norbert Polat	Sous-graphes traçables des graphes infinis.	Discrete Mathematics	1982	DBLP DOI BibTeX RDF

Publications of "Norbert Polat" ( http://dblp.L3S.de/Authors/Norbert_Polat )