✦ LIBER ✦

Color Chain of a Graph

✍ Scribed by R. Balakrishnan; T. Kavaskar

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 259 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0989-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A more rapidly mixing Markov chain for g

A more rapidly mixing Markov chain for graph colorings

✍ Martin Dyer; Catherine Greenhill 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 351 KB 👁 2 views

We define a new Markov chain on proper k-colorings of graphs, and relate its convergence properties to the maximum degree ⌬ of the graph. The chain is shown to have bounds on convergence time appreciably better than those for the well-known JerrumrSalas᎐Sokal chain in most circumstances. For the cas

On Markov Chains for Randomly H-Coloring

On Markov Chains for Randomly H-Coloring a Graph

✍ Colin Cooper; Martin Dyer; Alan Frieze 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let H = W F be a graph without multiple edges, but with the possibility of having loops. Let G = V E be a simple graph. A homomorphism c is a map c V → W with the property that v w ∈ E implies that c v c w ∈ F. We will often refer to c v as the color of v and c as an H-coloring of G. We consider the

The color space of a graph

✍ Tommy R. Jensen; Carsten Thomassen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB 👁 1 views

Relaxed Coloring of a Graph

✍ Sunanda Bagchi 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 82 KB

Partition graphs and coloring numbers of

Partition graphs and coloring numbers of a graph

✍ E. Sampathkumar; V.N. Bhave 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Coloring a graph optimally with two colo

Coloring a graph optimally with two colors

✍ H.J. Broersma; F. Göbel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Let G be a graph with point set V. A (2.)c,oloring of G is a map of V to ired, white!. An error occurs whenever the two endpoints of a line have the same color. An oprimul doring of G is a coloring of G for which the number of errors is minimum. The minimum number of errors is denoted by y(G), we de