✦ LIBER ✦

Generalized local colorings of graphs

✍ Scribed by Miroslaw Truszczyński

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 649 KB
Volume: 54
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90049-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized k-tuple colorings of cycles

Generalized k-tuple colorings of cycles and other graphs

✍ R.C Brigham; R.D Dutton 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Coloring graphs with locally few colors

✍ P Erdös; Z Füredi; A Hajnal; P Komjáth; V Rödl; Á Seress 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 832 KB

Let G be a graph, m > r t> 1 integers. Suppose that it has a good-coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2.4) states: The chromatic number of G, Chr(G) ~< r2" log21og2 m (an

T-colorings of graphs

✍ Daphne Der-Fen Liu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 594 KB

Given a finite set T of positive integers containing {0}, a T-coloring of a simple graph G is a nonnegative integer function f defined on the vertex set of G, such that if (u, v} E E(G) then Lf(u) -f (u)l $ T. The T-span of a T-coloring is defined as the difference of the largest and smallest colors

Relative colorings of graphs

✍ Paul C Kainen 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 231 KB

On generalized graph colorings

✍ Jason I. Brown; Derek G. Corneil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 610 KB

Given a property P, graph G. and k 2 0, a P k-coloring is a function 7r: V(G) + { I , ... , k) such that the subgraph induced by each color class has property P; x ( G : P ) is the least k, for which G has a P k-coloring. We investigate here the theory of P colorings. Generalizations of the wellknow

Extending colorings of locally planar gr

Extending colorings of locally planar graphs

✍ Michael O. Albertson; Joan P. Hutchinson 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

Suppose G is a graph embedded in S g with width (also known as edge width) at least 264(2 g À 1). If P V(G) is such that the distance between any two vertices in P is at least 16, then any 5-coloring of P extends to a 5-coloring of all of G. We present similar extension theorems for 6-and 7-chromati