𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linked-cluster expansion for the graph-vertex coloration problem

✍ Scribed by George A Baker Jr.

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
636 KB
Volume
10
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some undecidable problems involving the
Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
✍ Stefan A. Burr πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 477 KB

Certain problems involving the coloring the edges or vertices of infinite graphs are shown to be undecidable. In particular, let G and H be finite 3-connected graphs, or triangles. Then a doubly-periodic infinite graph F is constructed such that the following problem is undecidable: For a coloring o

Some new bounds for the maximum number o
Some new bounds for the maximum number of vertex colorings of a (v,e)-graph
✍ Byer, Owen D. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 3 views

Let f (v, e, Ξ») denote the maximum number of proper vertex colorings of a graph with v vertices and e edges in Ξ» colors. In this paper we present some new upper bounds for f (v, e, Ξ»). In particular, a new notion of pseudoproper colorings of a graph is given, which allows us to significantly improve

THE VAN KAMPEN EXPANSION FOR LINKED DUFF
THE VAN KAMPEN EXPANSION FOR LINKED DUFFING-LINEAR OSCILLATORS EXCITED BY COLORED NOISE
✍ E.M. Weinstein; H. Benaroya πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 677 KB

This paper expands on previous work by RodrΔ±Β΄guez and van Kampen, and by Weinstein and Benaroya. The original work by RodrΔ±Β΄guez and van Kampen outlined a method of extracting information from the Fokker-Planck equation without having to solve the equation itself. In the van Kampen expansion, the Fo