AbstractIn this note a short new proof of Diestel's characterization theorem for infinitek-connected rayless graphs is given, using the concept of the order of a rayless graph which was introduced by R. Schmidt
The main subject of this thesis is the infinite graph version of the weak linkage conjecture by Thom...
AbstractSome relations between the number of nodes and edges and the degrees of the nodes in infinit...
AbstractA graph G is called bounded if for every mapping ƒ:V(G)→N there exists a sequence (Cn)nϵN of...
AbstractIn this note a short new proof of Diestel's characterization theorem for infinitek-connected...
AbstractWe prove a conjecture of Širáň describing the graphs in which every spanning tree is end-fai...
AbstractA graph G is called bounded if for every mapping ƒ:V(G)→N there exists a sequence (Cn)nϵN of...
AbstractThe closure of a set A of vertices of an infinite graph G is defined as the set of vertices ...
The previous articles [5] and [6] introduced formalizations of the step-by-step operations we use to...
AbstractWe consider the question whether an infinite eulerian graph has a decomposition into circuit...
The main focus of this paper will be on two very different areas in which topology is relevant to th...
AbstractWe prove that if a rayless tree T is mutually embeddable and non-isomorphic with another ray...
AbstractIt is shown in this paper that the pair (G,H) is Ramsey infinite when both G and H are fores...
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infini...
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infini...
AbstractWe present several sufficient conditions for an end-faithful forest to be extendable to an e...
The main subject of this thesis is the infinite graph version of the weak linkage conjecture by Thom...
AbstractSome relations between the number of nodes and edges and the degrees of the nodes in infinit...
AbstractA graph G is called bounded if for every mapping ƒ:V(G)→N there exists a sequence (Cn)nϵN of...
AbstractIn this note a short new proof of Diestel's characterization theorem for infinitek-connected...
AbstractWe prove a conjecture of Širáň describing the graphs in which every spanning tree is end-fai...
AbstractA graph G is called bounded if for every mapping ƒ:V(G)→N there exists a sequence (Cn)nϵN of...
AbstractThe closure of a set A of vertices of an infinite graph G is defined as the set of vertices ...
The previous articles [5] and [6] introduced formalizations of the step-by-step operations we use to...
AbstractWe consider the question whether an infinite eulerian graph has a decomposition into circuit...
The main focus of this paper will be on two very different areas in which topology is relevant to th...
AbstractWe prove that if a rayless tree T is mutually embeddable and non-isomorphic with another ray...
AbstractIt is shown in this paper that the pair (G,H) is Ramsey infinite when both G and H are fores...
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infini...
We show that any graph that contains k edge-disjoint double rays for any k>0 contains also infini...
AbstractWe present several sufficient conditions for an end-faithful forest to be extendable to an e...
The main subject of this thesis is the infinite graph version of the weak linkage conjecture by Thom...
AbstractSome relations between the number of nodes and edges and the degrees of the nodes in infinit...
AbstractA graph G is called bounded if for every mapping ƒ:V(G)→N there exists a sequence (Cn)nϵN of...
DOI
Add to ORKG