AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts of A-paths and of A-separators, and we determine the maximum number of pairwise disjoint A-path
AbstractLet G be an infinite graph decomposing the plane into polygonal regions. We assume that ther...
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his ...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractLet A be a family of sets of ends of an infinite graph, having the property that every eleme...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractLet A and B be two sets of ends of an infinite graph, having the property that every element...
AbstractLet A be a family of sets of ends of an infinite graph, having the property that every eleme...
A well-known conjecture of Erdős states that, given an infinite graph G and sets A,B ⊆ V (G), there...
Partial answers are given to a problem of Erdös about the extension of a version of Menger's theorem...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractWe study topological versions of paths, cycles and spanning trees in infinite graphs with en...
AbstractSuppose G is a finite graph and let T ⊆ V(G) be a subset of its vertices throughout referred...
AbstractFor an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a...
AbstractGiven an infinite graph G, let deg∞(G) be defined as the smallest d for which V(G) can be pa...
AbstractLet G be an infinite graph decomposing the plane into polygonal regions. We assume that ther...
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his ...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractLet A be a family of sets of ends of an infinite graph, having the property that every eleme...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
AbstractLet A and B be two sets of ends of an infinite graph, having the property that every element...
AbstractLet A be a family of sets of ends of an infinite graph, having the property that every eleme...
A well-known conjecture of Erdős states that, given an infinite graph G and sets A,B ⊆ V (G), there...
Partial answers are given to a problem of Erdös about the extension of a version of Menger's theorem...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractWe study topological versions of paths, cycles and spanning trees in infinite graphs with en...
AbstractSuppose G is a finite graph and let T ⊆ V(G) be a subset of its vertices throughout referred...
AbstractFor an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a...
AbstractGiven an infinite graph G, let deg∞(G) be defined as the smallest d for which V(G) can be pa...
AbstractLet G be an infinite graph decomposing the plane into polygonal regions. We assume that ther...
Infinite generalizations of theorems in finite combinatorics were initiated by Erd\H{o}s due to his ...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
DOI
Add to ORKG