In this paper we give a complete solution of the simple minimum covering problem for K(v) with copies of a graph G having at least one vertex of degree one and such that E(G) = V(G) = 5, for all v greater than or equal to 7 and for all possible paddings. (C) 2004 Elsevier B.V. All rights reserved.
Coverings of a complete graph with five-vertex and five-edge graphs
MILICI, Salvatore
2004-01-01
Abstract
In this paper we give a complete solution of the simple minimum covering problem for K(v) with copies of a graph G having at least one vertex of degree one and such that E(G) = V(G) = 5, for all v greater than or equal to 7 and for all possible paddings. (C) 2004 Elsevier B.V. All rights reserved.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
