We answer a question of Juhász by constructing under CH an example of a locally connected continuum without nontrivial convergent sequences.  2002 Elsevier Science B.V. All rights reserved.

0.1. This paper presents an investigation of the following problem. Exhibit a class X of topological spaces which contains all peano spaces and which has the following properties: (1) a cyclic element theory exists in each space of the class, (2) the abstract set consisting of all cyclic element of any space X of the class can be topologized so as to be a member of the class X, and (3) the hype...

We construct, assuming Jensen’s principle ♦, a one-dimensional locally connected hereditarily separable continuum without convergent sequences.

A graph G is N2-locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryjác̆ek conjectured that every 3-connected N2-locally connected claw-free graph is hamiltonian. This conjecture is proved in this note.

A recursion category is locally connected if connected domains are jointly epimorphic. New proofs of the existence of non-complemented and recursively inseparable domains are given in a locally connected category. The use of local connectedness to produce categorical analogs of undecidable problems is new; the approach allows us to relax the hypotheses under which the results were originally pr...

Hofmann and Morris [6] proved that a locally compact connected group G has a finite subset generating a dense subgroup if and only if the weight w(G) of G does not exceed c , the cardinality of the continuum. The minimum cardinality of such a topological generating set is an invariant of the group, is denoted by σ(G), and is called the topological rank of G . For compact abelian groups of weigh...

A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v ∈ V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.

We construct, assuming Jensen’s principle ♦, a one-dimensional locally connected hereditarily separable continuum without convergent sequences.