AbstractIn this paper we give some new lower bounds for the cover-index of graphs with multiple edges permitted. The results are analogous to upper bounds for the chromatic index. We show that a simple graph with cover-index different from the minimum degree has at least three vertices of minimum degree. This implies that almost all simple graphs have cover-index equal to the minimum degree
A procedure for counting edge covers of simple graphs is presented. The procedure splits simpl...
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vert...
A star edge coloring is any edge coloring which is both proper and contains no cycles or path of len...
AbstractIn this paper we give some new lower bounds for the cover-index of graphs with multiple edge...
AbstractTheorems of Vizing and Shannon establish upper bounds for the chromatic index of a graph. Us...
AbstractThe problem of covering the vertex set of a graph with subsets spanning subgraphs of smaller...
International audienceWe consider the problem of covering an input graph H with graphs from a fixed ...
AbstractUpper and lower bounds for the covering number of a graph are obtained. It is shown, by prob...
We construct a family of r-graphs having a minimum 1-factor cover of cardinality 2r − 1 (disproving ...
Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of cover...
A vertex covering set S containing at least one vertex from each color class is called a vertex cove...
Using majorization, we find lower bounds for the geometric–arithmetic index of graphs containing eit...
AbstractA total cover of a graph G is a subset of V(G)∪E(G) which covers all elements of V(G)∪E(G). ...
An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges...
The excessive [m]-index of a graph G, denoted by χ′[m](G), is the minimum number of matchings of si...
A procedure for counting edge covers of simple graphs is presented. The procedure splits simpl...
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vert...
A star edge coloring is any edge coloring which is both proper and contains no cycles or path of len...
AbstractIn this paper we give some new lower bounds for the cover-index of graphs with multiple edge...
AbstractTheorems of Vizing and Shannon establish upper bounds for the chromatic index of a graph. Us...
AbstractThe problem of covering the vertex set of a graph with subsets spanning subgraphs of smaller...
International audienceWe consider the problem of covering an input graph H with graphs from a fixed ...
AbstractUpper and lower bounds for the covering number of a graph are obtained. It is shown, by prob...
We construct a family of r-graphs having a minimum 1-factor cover of cardinality 2r − 1 (disproving ...
Let m be a positive integer and let G be a cubic graph of order 2n. We consider the problem of cover...
A vertex covering set S containing at least one vertex from each color class is called a vertex cove...
Using majorization, we find lower bounds for the geometric–arithmetic index of graphs containing eit...
AbstractA total cover of a graph G is a subset of V(G)∪E(G) which covers all elements of V(G)∪E(G). ...
An area in graph theory is graph colouring, which essentially is a labeling of the vertices or edges...
The excessive [m]-index of a graph G, denoted by χ′[m](G), is the minimum number of matchings of si...
A procedure for counting edge covers of simple graphs is presented. The procedure splits simpl...
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vert...
A star edge coloring is any edge coloring which is both proper and contains no cycles or path of len...
DOI
Add to ORKG