summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs
In [1] V. G. Vizing proposes the problem of finding an algorithm for finding a spanning tree of a gi...
A graph is k-indivisible, where k is a positive integer, if the deletion of any finite set of vertic...
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...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
SIGLETIB Hannover: RO 8278(90-025) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Inf...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX91560 / BLDSC - British Library Do...
summary:For an end $\tau $ and a tree $T$ of a graph $G$ we denote respectively by $m(\tau )$ and $m...
AbstractWe prove that every infinite, connected, locally finite graph G can be expressed as an edge-...
summary:Let $T$ be an infinite locally finite tree. We say that $T$ has exactly one end, if in $T$ a...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bi...
In 1966, Cummins introduced the “tree graph”: the tree graph T(G) of a graph G (possibly infinite) h...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
In [1] V. G. Vizing proposes the problem of finding an algorithm for finding a spanning tree of a gi...
A graph is k-indivisible, where k is a positive integer, if the deletion of any finite set of vertic...
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...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
SIGLETIB Hannover: RO 8278(90-025) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Inf...
SIGLEAvailable from British Library Document Supply Centre- DSC:DX91560 / BLDSC - British Library Do...
summary:For an end $\tau $ and a tree $T$ of a graph $G$ we denote respectively by $m(\tau )$ and $m...
AbstractWe prove that every infinite, connected, locally finite graph G can be expressed as an edge-...
summary:Let $T$ be an infinite locally finite tree. We say that $T$ has exactly one end, if in $T$ a...
AbstractFor a set A of pairwise disjoint sets of ends of an infinite graph, we define the concepts o...
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bi...
In 1966, Cummins introduced the “tree graph”: the tree graph T(G) of a graph G (possibly infinite) h...
International audienceWe consider standard algorithms of finite graph theory, like for instance shor...
AbstractWe discuss extensions of the Gallai-Milgram theorem to infinite graphs. We define a path to ...
In [1] V. G. Vizing proposes the problem of finding an algorithm for finding a spanning tree of a gi...
A graph is k-indivisible, where k is a positive integer, if the deletion of any finite set of vertic...
AbstractThis expository article describes work which has been done on various problems involving inf...
DOI
Add to ORKG