๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New Graph Decompositions with Applications to Emulations

โœ Scribed by C. Kaklamanis

Publisher
Springer
Year
1997
Tongue
English
Weight
94 KB
Volume
30
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Graph decomposition with applications to
Graph decomposition with applications to subdivisions and path systems modulo k
โœ Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 585 KB

The existence of a function a(k) (where k is a natural number) is established such that the vertex set of any graph G of minimum degree at least a ( k ) has a decomposition A U B U C such that G(A) has minimum degree a t least k , each vertex of A is joined to at least k vertices of B, and no two ve

Enumerating maximal independent sets wit
Enumerating maximal independent sets with applications to graph colouring
โœ Jesper Makholm Byskov ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 246 KB

We give tight upper bounds on the number of maximal independent sets of size k (and at least k and at most k) in graphs with n vertices. As an application of the proof, we construct improved algorithms for graph colouring and computing the chromatic number of a graph.