Given a collection of graphs H, an H¡decomposition of ¸Kv is a decomposition of the edges of ¸Kv into isomorphic copies of graphs in H. A kite is a triangle with a tail consisting of a single edge.In this paper we investigate the decomposition problem when H is the set containing a kite and a 4-cycle, that is; this paper gives a complete solution to the problem of decomposing ¸Kv into r kites and s 4-cycles for every admissible values of v, ¸, r and s.

Decomposition of λKv into kites and 4-cycles

MILICI, Salvatore
2017-01-01

Abstract

Given a collection of graphs H, an H¡decomposition of ¸Kv is a decomposition of the edges of ¸Kv into isomorphic copies of graphs in H. A kite is a triangle with a tail consisting of a single edge.In this paper we investigate the decomposition problem when H is the set containing a kite and a 4-cycle, that is; this paper gives a complete solution to the problem of decomposing ¸Kv into r kites and s 4-cycles for every admissible values of v, ¸, r and s.
2017
Graph decomposition, Graph decomposition, G-design Graph decomposition ; G-design; kite, 4-cycle
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/56031
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact