✦ LIBER ✦

A note on the (g,f)-coloring

✍ Scribed by Changqing Xu; Guizhen Liu

Book ID: 107619745
Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 256 KB
Volume: 28
Category: Article
ISSN: 1598-5865
DOI: 10.1007/s12190-008-0094-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on list improper coloring planar

A note on list improper coloring planar graphs

✍ Ko-Wei Lih; Zengmin Song; Weifan Wang; Kemin Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A graph G is called (k, d)\*-choosable if, for every list assignment L satisfying [L(v)l = k for all v E V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and /-c

Note on a new coloring number of a graph

✍ P. Horák; J. Širáň 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB 👁 1 views

## Abstract The distance coloring number __X__~__d__~(__G__) of a graph __G__ is the minimum number __n__ such that every vertex of __G__ can be assigned a natural number __m__ ≤ __n__ and no two vertices at distance __i__ are both assigned __i__. It is proved that for any natural number __n__ ther

A note on list-colorings

✍ Amanda Chetwynd; Roland Häggkvist 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

In this article we discuss the current results on the list chromatic conjecture and prove that if G is a triangle free graph with maximum degree A then xi(G) 5 9A/5. If the term "a classic" can be used about a mathematical problem less than 10 years old, then surely the following question by Jeff D

A note on group colorings

✍ Daniel Král'; Ondřej Pangrác; Heinz-Jürgen Voss 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

## Abstract We study a concept of group coloring introduced by Jaeger et al. We show that the group chromatic number of a graph with minimum degree δ is greater than δ/(2, ln δ) and we answer several open questions on the group chromatic number of planar graphs: a construction of a bipartite planar

A Note on First-Fit Coloring of Interval

A Note on First-Fit Coloring of Interval Graphs

✍ N. S. Narayanaswamy; R. Subhash Babu 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 223 KB

A note on the three color problem

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 229 KB