In this paper we consider uniformly resolvable decompositions of the com- plete graph Kv, i.e., decompositions of Kv whose blocks can be partitioned into factors and each factor contains pairwise isomorphic blocks. We de- termine necessary and sucient conditions for the existence of a uniformly resolvable decomposition of Kv into paths on two, three and four vertices.

Uniformly resolvable decompositions of Kv into paths on two, three and four vertices

MILICI, Salvatore;
2015-01-01

Abstract

In this paper we consider uniformly resolvable decompositions of the com- plete graph Kv, i.e., decompositions of Kv whose blocks can be partitioned into factors and each factor contains pairwise isomorphic blocks. We de- termine necessary and sucient conditions for the existence of a uniformly resolvable decomposition of Kv into paths on two, three and four vertices.
2015
Resolvable graph decomposition; Uniform factorization; Paths
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/34459
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? ND
social impact