𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Partitional and Other Related Graphs

✍ Scribed by Rikio Ichishima; Akito Oshima

Book ID
107508954
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
262 KB
Volume
5
Category
Article
ISSN
1661-8270

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Partitional Labelings of Graphs
On Partitional Labelings of Graphs
✍ Rikio Ichishima; Akito Oshima πŸ“‚ Article πŸ“… 2009 πŸ› Springer-Verlag 🌐 English βš– 191 KB
On partitioning interval graphs into pro
On partitioning interval graphs into proper interval subgraphs and related problems
✍ FrΓ©dΓ©ric Gardi πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

In this paper, we establish that any interval graph (resp. circulararc graph) with n vertices admits a partition into at most log 3 n (resp. log 3 n +1) proper interval subgraphs, for n>1. The proof is constructive and provides an efficient algorithm to compute such a partition. On the other hand, t

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