AbstractFor every countable, connected graph A containing no one-way infinite path the following is shown: Let G be an arbitrary graph which contains for every positive integer n a system of n disjoint graphs each isomorphic to a subdivision of A. Then G also contains infinitely many disjoint subgraphs each isomorphic to a subdivision of A. In addition, corrections of errors are given that occur unfortunately in the forerunner of the present paper
AbstractIn 1964 R. Halin raised the question if every infinite connected graph G has a spanning tree...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
One of the basic results in graph theory is Dirac's theorem, that every graph of order n⪖3 and minim...
AbstractFor every countable, connected graph A containing no one-way infinite path the following is ...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
AbstractLet A be an arbitrary locally finite, infinite tree and assume that a graph G contains for e...
AbstractLake has constructed graphs G and H such that H contains n disjoint subgraphs isomorphic to ...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractWe show that a graph can always be decomposed into edge-disjoint subgraphs of countable card...
AbstractThis expository article describes work which has been done on various problems involving inf...
summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disj...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractA graph G is traceable if there is a path passing through all the vertices of G. It is prove...
Using the resolution theorem prover OTTER we prove that a certain directed graph has no infinite pat...
A graph is k-indivisible, where k is a positive integer, if the deletion of any finite set of vertic...
AbstractIn 1964 R. Halin raised the question if every infinite connected graph G has a spanning tree...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
One of the basic results in graph theory is Dirac's theorem, that every graph of order n⪖3 and minim...
AbstractFor every countable, connected graph A containing no one-way infinite path the following is ...
AbstractWe show that there are graphs G and H which satisfy: (I) for every integer n, H contains n d...
AbstractLet A be an arbitrary locally finite, infinite tree and assume that a graph G contains for e...
AbstractLake has constructed graphs G and H such that H contains n disjoint subgraphs isomorphic to ...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
AbstractWe show that a graph can always be decomposed into edge-disjoint subgraphs of countable card...
AbstractThis expository article describes work which has been done on various problems involving inf...
summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disj...
AbstractErdős conjectured that, given an infinite graph G and vertex sets A,B⊆V(G), there exist a se...
AbstractA graph G is traceable if there is a path passing through all the vertices of G. It is prove...
Using the resolution theorem prover OTTER we prove that a certain directed graph has no infinite pat...
A graph is k-indivisible, where k is a positive integer, if the deletion of any finite set of vertic...
AbstractIn 1964 R. Halin raised the question if every infinite connected graph G has a spanning tree...
AbstractMenger's theorem can be stated as follows: Let G = (V, E) be a finite graph, and let A and B...
One of the basic results in graph theory is Dirac's theorem, that every graph of order n⪖3 and minim...
DOI
Add to ORKG