✦ LIBER ✦

The method of coloring in graphs and its application

✍ Scribed by Guizhen Liu; Jianfeng Hou

Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2010
Tongue: English
Weight: 224 KB
Volume: 23
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-010-0211-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A structural theorem on embedded graphs

A structural theorem on embedded graphs and its application to colorings

✍ Bao Gang Xu; Xiao Xu Lu 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 160 KB

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

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

Color in machine vision and its applicat

Color in machine vision and its application

✍ Linmi Tao; Guangyou Xu 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 286 KB

A generalization of edge-coloring in gra

A generalization of edge-coloring in graphs

✍ S. Louis Hakimi; Oded Kariv 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all

Game coloring the Cartesian product of g

Game coloring the Cartesian product of graphs

✍ Xuding Zhu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB

## Abstract This article proves the following result: Let __G__ and __G__′ be graphs of orders __n__ and __n__′, respectively. Let __G__^\*^ be obtained from __G__ by adding to each vertex a set of __n__′ degree 1 neighbors. If __G__^\*^ has game coloring number __m__ and __G__′ has acyclic chromat