✦ LIBER ✦

Quotient tree partitioning of undirected graphs

✍ Scribed by Anders Edenbrandt

Publisher: Springer Netherlands
Year: 1986
Tongue: English
Weight: 433 KB
Volume: 26
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933740

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning Graphs of Bounded Tree-Widt

Partitioning Graphs of Bounded Tree-Width

✍ Guoli Ding; Bogdan Oporowski; Daniel P. Sanders; Dirk Vertigan 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 199 KB

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

✍ 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.

An algorithm for determining the automor

An algorithm for determining the automorphism partitioning of an undirected graph

✍ D. G. Corneil 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 563 KB

Undirected power graphs of semigroups

✍ Ivy Chakrabarty; Shamik Ghosh; M. K. Sen 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 440 KB

Partitioning complete multipartite graph

Partitioning complete multipartite graphs by monochromatic trees

✍ Atsushi Kaneko; M. Kano; Kazuhiro Suzuki 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K (n 1 ; n 2 ; . . . ; n k )) of the c