Uniformly resolvable decompositions of Kv into P3 and K3 graphs
نویسندگان
چکیده
In this paper we consider the uniformly resolvable decompositions of the complete graph Kv , or the complete graph minus a 1-factor as appropriate, into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes are either P3 or K3. AMS classification: 05B05.
منابع مشابه
Uniformly resolvable ℋ-designs with ℋ={P3, 4}
In this paper we consider the problem regarding the existence of uniformly resolvable decompositions of the complete graph Kv into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We completely determine the spectrum for the case in which all the resolution classes are either P3 or P4.
متن کاملA note on uniformly resolvable decompositions of Kv and Kv-I into 2-stars and 4-cycles
In this paper we consider the uniformly resolvable decomposition of the complete graph Kv, or the complete graph minus a 1-factor Kv − I, into two graphs such that each resolution class contains only blocks isomorphic to the same graph. We completely solve the case in which the resolution classes are either all 2-stars or 4-cycles.
متن کاملOn complementary path decompositions of the complete multigraph
We give a complete solution to the existence problem for complementary P3-decompositions of the complete multigraph, where P 3 denotes the path of length 3. A complementary decomposition 2>.K v (P 3 , P 3) is an edge decomposition of the complete multigraph >'Kv into P 3 '8 with the property that upon taking the complement of each path one obtains a second decomposition of >'K3 into P3 '8 (wher...
متن کاملPartitioning a graph into disjoint cliques and a triangle-free graph
A (P3-free, K3-free)-colouring of a graph G = (V, E) is a partition of V = A ∪ B such that G[A] is P3-free and G[B] is K3-free. This problem is known to be NP-complete even when restricted to planar graphs and perfect graphs. In this paper, we provide a finite list of 17 forbidden induced subgraphs for cographs with a (P3-free, K3-free)colouring. This yields a linear time recognition algorithm.
متن کاملResolvable gregarious cycle decompositions of complete equipartite graphs
The complete multipartite graph Kn(m) with n parts of size m is shown to have a decomposition into n-cycles in such a way that each cycle meets each part of Kn(m); that is, each cycle is said to be gregarious. Furthermore, gregarious decompositions are given which are also resolvable. © 2007 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 331 شماره
صفحات -
تاریخ انتشار 2014