Mar 1, 1990 · This paper discusses the complexity of packingk-chains (simple paths of lengthk) into an undirected graph; the chains packed must be either ...
This paper discusses the complexity of packing k-chains (simple paths of length k) into an undirected graph; the chains packed must be either vertex-disjoint or ...
People also ask
What is a chain in graph theory?
What is the packing number of a graph?
What is the elementary path in graph theory?
This paper discusses the complexity of packingk-chains (simple paths of lengthk) into an undirected graph; the chains packed must be either vertex-disjoint ...
This paper discusses the complexity of packingk-chains (simple paths of lengthk) into an undirected graph; the chains packed must be either vertex-disjoint ...
We show that the use of augmenting chains fails in general to produce a new short chain packing from an old one, even for bipartite graphs, but that it does do ...
We present a parallel algorithm for finding a maximum 2-chain edge packing of an undirected graph G = (V, E). It runs in O(log n) time using O(n + m) ...
In Section 2.4 we consider packing and covering in terms of edges: we ask how many edge-disjoint spanning trees we can find in a given graph, and how few trees ...
Chain packing in graphs. Abstract. This paper discusses the complexity of packingk-chains (simple paths of lengthk) into an undirected graph; the chains ...
In this paper, we show that Tuza's conjecture is valid for co-chain graphs with even number of vertices in both sides of the partition, a known subclass of ...