𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Problem 78-11, Edge Three-Coloring of Tournaments

✍ Scribed by N. Megiddo

Book ID
124935204
Publisher
Society for Industrial and Applied Mathematics
Year
1978
Tongue
English
Weight
163 KB
Volume
20
Category
Article
ISSN
0036-1445

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the edge-coloring problem for a class
On the edge-coloring problem for a class of 4-regular maps
✍ F. Jaeger; H. Shank πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 300 KB πŸ‘ 1 views

## Abstract A (plane) 4‐regular map __G__ is called __C__‐simple if it arises as a superposition of simple closed curves (tangencies are not allowed); in this case Οƒ (__G__) is the smallest integer __k__ such that the curves of __G__ can be colored with __k__ colors in such a way that no two curves

Erratum: On the edge-coloring problem fo
Erratum: On the edge-coloring problem for a class of 4-regular maps
✍ F. Jaeger; H. Shank πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 37 KB πŸ‘ 1 views

On p. 272 of the above article, paragraph # 3 is incomplete. It should read as the following: Hence to prove Proposition 4 it is enough to show that the edges of Q 4 can be colored with 4 colors in such a way that each square has one edge of each color. Such a coloring is displayed on the following

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