Star partitions of graphs
β
Egawa, Y.; Kano, M.; Kelmans, Alexander K.
π
Article
π
1997
π
John Wiley and Sons
π
English
β 78 KB
π 2 views
Let G be a graph and n β₯ 2 an integer. We prove that the following are equivalent: (i) there is a partition , and (ii) for every subset S of V (G), G \ S has at most n|S| components with the property that each of their blocks is an odd order complete graph.