𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On some algorithmic investigations of star partitions of graphs

✍ Scribed by Dragos̆ Cvetković; Peter Rowlinson; Slobodan Simić

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
729 KB
Volume
62
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Star partitions of graphs
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.

On tree-partitions of graphs
On tree-partitions of graphs
✍ Guoli Ding; Bogdan Oporowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 725 KB

A graph G admits a tree-partition of width k if its vertex set can be partitioned into sets of size at most k so that the graph obtained by identifying the vertices in each set of the partition, and then deleting loops and parallel edges, is a forest. In the paper, we characterize the classes of gra

On partitions of graphs into trees
On partitions of graphs into trees
✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

On clique partitions of split graphs
On clique partitions of split graphs
✍ W.D. Wallis; J. Wu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique

Note on vertex-partitions of infinite gr
Note on vertex-partitions of infinite graphs
✍ János Pach; Joel H. Spencer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}