A path partition or a path cover of a graph G is a collection P of paths in G such that every edge of G is in exactly one path in P. Various types of path covers such as Smarandache path k-cover, simple path covers have been studied by several authors by imposing conditions on the paths in the path covers. In this paper, We study the minimum number of paths which cover a graph such that each edge of the graph occurs exactly twice in two(distinct) paths
AbstractA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k...
Ph.D.The induced path number p(G) of a graph G is defined as the minimum number of subsets into whic...
AbstractLet n⩾6. There exists a uniform covering of 2-paths with 5-paths in Kn if and only if n is e...
A path partition or a path cover of a graph G is a collection P of paths in G such that every edge o...
Abstract: A simple path cover of a graph G is a collection ψ of paths in G such that every edge of G...
A simple path cover of a graph G is a collection of paths in G such that every edge of G is in exa...
AbstractAn acyclic graphoidal cover of a graph G is a collection ψ of paths in G such that every pat...
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G co...
AbstractA perfect path double cover (PPDC) of a graph G is a family P of paths of G such that every ...
AbstractFor a given undirected graph G, the maximum multiplicity of G is defined to be the largest m...
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G co...
We dedicate this work to Pauline van den Driessche for her life long contributions to linear algebra...
A subset ▫$S$▫ of vertices of a graph ▫$G$▫ is called a vertex ▫$k$▫-path cover if every path of ord...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractLet G = (V,E) be a block graph. First we show that an algorithm for finding the path partiti...
AbstractA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k...
Ph.D.The induced path number p(G) of a graph G is defined as the minimum number of subsets into whic...
AbstractLet n⩾6. There exists a uniform covering of 2-paths with 5-paths in Kn if and only if n is e...
A path partition or a path cover of a graph G is a collection P of paths in G such that every edge o...
Abstract: A simple path cover of a graph G is a collection ψ of paths in G such that every edge of G...
A simple path cover of a graph G is a collection of paths in G such that every edge of G is in exa...
AbstractAn acyclic graphoidal cover of a graph G is a collection ψ of paths in G such that every pat...
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G co...
AbstractA perfect path double cover (PPDC) of a graph G is a family P of paths of G such that every ...
AbstractFor a given undirected graph G, the maximum multiplicity of G is defined to be the largest m...
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G co...
We dedicate this work to Pauline van den Driessche for her life long contributions to linear algebra...
A subset ▫$S$▫ of vertices of a graph ▫$G$▫ is called a vertex ▫$k$▫-path cover if every path of ord...
AbstractA k-cycle double cover of a graph G is a collection L of at most k eulerian subgraphs of G s...
AbstractLet G = (V,E) be a block graph. First we show that an algorithm for finding the path partiti...
AbstractA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k...
Ph.D.The induced path number p(G) of a graph G is defined as the minimum number of subsets into whic...
AbstractLet n⩾6. There exists a uniform covering of 2-paths with 5-paths in Kn if and only if n is e...
DOI
Add to ORKG