𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a property of the class of n-colorable graphs

✍ Scribed by D Seinsche

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
129 KB
Volume
16
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A property of the colored complete graph
A property of the colored complete graph
✍ J. Shearer πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 433 KB

If the lines of the complete graph K,, are calmed so that no point is on more than +(n -1) lines of the same color or so that each point lies on more than $(5n + 8) lines of different colors, then K,, contains a cycle of length n with adjacent lines having different colors. Let the lines of a graph

Characterization of a class of triangle-
Characterization of a class of triangle-free graphs with a certain adjacency property
✍ Brian Alspach; C. C. Chen; Katherine Heinrich πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 597 KB

## Abstract Let __m__ and __n__ be nonnegative integers. Denote by __P__(__m,n__) the set of all triangle‐free graphs __G__ such that for any independent __m__‐subset __M__ and any __n__‐subset __N__ of __V__(__G__) with __M__ ∩ __N__ = Ø, there exists a unique vertex of __G__ that is adjacent to e

Mixing properties of the Swendsen–Wang p
Mixing properties of the Swendsen–Wang process on classes of graphs
✍ Colin Cooper; Alan M. Frieze πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 194 KB πŸ‘ 2 views

We consider the mixing properties of the widely used Swendsen-Wang process for the Markov chain Monte Carlo estimation of the partition function of the ferromagnetic Q-state Potts model, for certain classes of graphs. In the paper "The Swendsen-Wang Process Does Not Always Mix Rapidly," V. Gore and