𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quantum field theory and the coloring problem of graphs

✍ Scribed by Noboru Nakanishi

Publisher
Springer
Year
1973
Tongue
English
Weight
862 KB
Volume
32
Category
Article
ISSN
0010-3616

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The complexity of the T-coloring problem
The complexity of the T-coloring problem for graphs with small degree
✍ Krzysztof Giaro; Robert Janczewski; MichaΕ‚ MaΕ‚afiejski πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 194 KB

In the paper we consider a generalized vertex coloring model, namely T -coloring. For a given ΓΏnite set T of nonnegative integers including 0, a proper vertex coloring is called a T -coloring if the distance of the colors of adjacent vertices is not an element of T . This problem is a generalization

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

Multi-coloring the Mycielskian of graphs
Multi-coloring the Mycielskian of graphs
✍ Wensong Lin; Daphne Der-Fen Liu; Xuding Zhu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 129 KB

## Abstract A __k__‐fold coloring of a graph is a function that assigns to each vertex a set of __k__ colors, so that the color sets assigned to adjacent vertices are disjoint. The __k__th chromatic number of a graph __G__, denoted by Ο‡~__k__~(__G__), is the minimum total number of colors used in a