A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path or a union of paths (a linear forest). We survey known results when the graph and the linear forest are of prescribed types, and when the decomposition satisfies further additional properties.</span
Introducing and initiating a study of a new variation of decomposition namely equiparity induced pat...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
The focus of this thesis is the concept of tree-decomposition. A tree-decomposition of a graph G is ...
A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every e...
A decomposition of a graph G is a collection ψ = {H1,H2,...,Hk} of subgraphs of G such that every ed...
Ph.D.The induced path number p(G) of a graph G is defined as the minimum number of subsets into whic...
Ph.D.The induced path number p(G) of a graph G is defined as the minimum number of subsets into whic...
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the ar...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
This paper deals with the subject of minimal path decomposition of complete bipartite graphs. A path...
Introducing and initiating a study of a new variation of decomposition namely equiparity induced pat...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path o...
The focus of this thesis is the concept of tree-decomposition. A tree-decomposition of a graph G is ...
A decomposition of a graph G is a collection ψ of subgraphs H1,H2, . . . , Hr of G such that every e...
A decomposition of a graph G is a collection ψ = {H1,H2,...,Hk} of subgraphs of G such that every ed...
Ph.D.The induced path number p(G) of a graph G is defined as the minimum number of subsets into whic...
Ph.D.The induced path number p(G) of a graph G is defined as the minimum number of subsets into whic...
A decomposition of a graph is a partition of the edge set. One can also look at partitions of the ar...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
ABSTRACT. Expressions for the path polynomials (see Farrell [I]) of chains and cir-cuits are derived...
This paper deals with the subject of minimal path decomposition of complete bipartite graphs. A path...
Introducing and initiating a study of a new variation of decomposition namely equiparity induced pat...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pair...
Add to ORKG