Add to ORKGIn this paper, we study minimal path cover sets of union of certain graphs. As consequences, we study max-path ideals with certain heights.Key words: Trees, paths, cycles, associated primes
Given an undirected graph G(V, E) and a vertex subset U ⊆ V the Uspace is the vector space over GF(2...
A subset X of vertices of a graph is a k-minimal P-set if X has property P, but the removal of any l...
AbstractA subset X of vertices of a graph is a k-minimal P-set if X has property P, but the removal ...
ABSTRACT. Let G be a graph. With every path of G let us associate a weitht w With every spanning sub...
AbstractA minimal k-cycle is a family of sets A0,…,Ak−1 for which Ai∩Aj≠0̸ if and only if i=j or i a...
AbstractFor a given undirected graph G, the maximum multiplicity of G is defined to be the largest m...
We dedicate this work to Pauline van den Driessche for her life long contributions to linear algebra...
AbstractLet minimum, maximum, refer to the number of elements in a set and let minimal, maximal refe...
A subset S of vertices of a graph G = (V,E) is called a k-path vertex cover if every path on k verti...
AbstractA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k...
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...
AbstractThe class of cographs, or complement-reducible graphs, arises naturally in many different ar...
A subset ▫$S$▫ of vertices of a graph ▫$G$▫ is called a vertex ▫$k$▫-path cover if every path of ord...
A subset S of vertices of a graph G = (V;E) is called a k-path vertex cover if every path on k verti...
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...
Given an undirected graph G(V, E) and a vertex subset U ⊆ V the Uspace is the vector space over GF(2...
A subset X of vertices of a graph is a k-minimal P-set if X has property P, but the removal of any l...
AbstractA subset X of vertices of a graph is a k-minimal P-set if X has property P, but the removal ...
ABSTRACT. Let G be a graph. With every path of G let us associate a weitht w With every spanning sub...
AbstractA minimal k-cycle is a family of sets A0,…,Ak−1 for which Ai∩Aj≠0̸ if and only if i=j or i a...
AbstractFor a given undirected graph G, the maximum multiplicity of G is defined to be the largest m...
We dedicate this work to Pauline van den Driessche for her life long contributions to linear algebra...
AbstractLet minimum, maximum, refer to the number of elements in a set and let minimal, maximal refe...
A subset S of vertices of a graph G = (V,E) is called a k-path vertex cover if every path on k verti...
AbstractA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k...
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...
AbstractThe class of cographs, or complement-reducible graphs, arises naturally in many different ar...
A subset ▫$S$▫ of vertices of a graph ▫$G$▫ is called a vertex ▫$k$▫-path cover if every path of ord...
A subset S of vertices of a graph G = (V;E) is called a k-path vertex cover if every path on k verti...
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...
Given an undirected graph G(V, E) and a vertex subset U ⊆ V the Uspace is the vector space over GF(2...
A subset X of vertices of a graph is a k-minimal P-set if X has property P, but the removal of any l...
AbstractA subset X of vertices of a graph is a k-minimal P-set if X has property P, but the removal ...