AbstractWe prove that every connected graph onnvertices can be covered by at mostn/2+O(n3/4) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
AbstractWe show that any connected graph with ϵ edges and covering number β satisfies the inequality...
In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be par...
In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be par...
In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be par...
AbstractThe path number p(G) of a graph G is the minimum number of paths needed to partition the edg...
AbstractLet G be a k-connected graph where k≥3. It is shown that if G contains a path L of length l ...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
AbstractThe purpose of this paper is to initiate study of the following problem: Let G be a graph, a...
AbstractLet G be a connected simple graph on n vertices. Gallai's conjecture asserts that the edges ...
AbstractLet c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A c...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) de...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
AbstractWe show that any connected graph with ϵ edges and covering number β satisfies the inequality...
In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be par...
In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be par...
In the 1960s, Erdős and Gallai conjectured that the edge set of every graph on n vertices can be par...
AbstractThe path number p(G) of a graph G is the minimum number of paths needed to partition the edg...
AbstractLet G be a k-connected graph where k≥3. It is shown that if G contains a path L of length l ...
AbstractIt is proved that every eulerian simple graph on n vertices can be covered by at most ⌊n−12⌋...
AbstractThe purpose of this paper is to initiate study of the following problem: Let G be a graph, a...
AbstractLet G be a connected simple graph on n vertices. Gallai's conjecture asserts that the edges ...
AbstractLet c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A c...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) de...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
Remark on the paper "Minimum vertex covers in the generalized Petersen graphs P(n; 2)" by M. Behzad...
DOI
Add to ORKG