Locally closed sets and LC-continuous functions.
Ganster, M., Reilly, I.L. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ganster, M., Reilly, I.L. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Nachbin, Leopoldo (1992)
Portugaliae mathematica
Similarity:
Al-Addasi, Salah (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Konstadilaki-Savvopoulou, Ch., Janković, D. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Marek Wilhelm (1979)
Fundamenta Mathematicae
Similarity:
Roman Nedela (1992)
Czechoslovak Mathematical Journal
Similarity:
Baker, C.W. (1998)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Roger Bielawski (1989)
Fundamenta Mathematicae
Similarity:
Walter Taylor (1969)
Fundamenta Mathematicae
Similarity:
Isaac Goldbring, Alessandro Sisto (2016)
Fundamenta Mathematicae
Similarity:
The end compactification |Γ| of a locally finite graph Γis the union of the graph and its ends, endowed with a suitable topology. We show that π₁(|Γ|) embeds into a nonstandard free group with hyperfinitely many generators, i.e. an ultraproduct of finitely generated free groups, and that the embedding we construct factors through an embedding into an inverse limit of free groups. We also show how to recover the standard description of π₁(|Γ|) given by Diestel and Sprüssel (2011). Finally,...
Ljubomir Čukić (1993)
Matematički Vesnik
Similarity:
Ewa Łazuka, Jerzy Żurawiecki (2000)
Discussiones Mathematicae Graph Theory
Similarity:
We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k-1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de Bruijn graphs in order to define a class of so called regular factors, which is not so difficult...