𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Glauber Dynamics for Colorings of Bounded Degree Trees

✍ Scribed by Lucier, B.; Molloy, M.

Book ID
118197115
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
285 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The achromatic number of bounded degree
The achromatic number of bounded degree trees
✍ Niall Cairnie; Keith Edwards πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 621 KB

The achromatic number ~b(G) of a simple graph G is the largest number of colours possible in a proper vertex colouring of G in which each pair of coiours appears on at least one edge. The problem of determining the achromatic number of a tree is known to be NP-hard (Cairnie and Edwards, 1997). In t

The 2-intersection number of paths and b
The 2-intersection number of paths and bounded-degree trees
✍ Michael S. Jacobson; AndrΓ© E. KΓ©zdy; Douglas B. West πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 416 KB πŸ‘ 1 views

## Abstract We represent a graph by assigning each vertex a finite set such that vertices are adjacent if and only if the corresponding sets have at least two common elements. The __2‐intersection number__ ΞΈ~2~(__G__) of a graph __G__ is the minimum size of the union of sets in such a representatio

Maximizing the number of independent sub
Maximizing the number of independent subsets over trees with bounded degree
✍ Clemens Heuberger; Stephan G Wagner πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 208 KB πŸ‘ 1 views

## Abstract The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has