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.
|Titolo:||Decomposition of Kv into kites and 4-cycles|
|Data di pubblicazione:||2017|
|Appare nelle tipologie:||1.1 Articolo in rivista|