✦ LIBER ✦

Bounded color functions on graphs

✍ Scribed by D. W. Matula

Publisher: John Wiley and Sons
Year: 1972
Tongue: English
Weight: 753 KB
Volume: 2
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230020104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounded vertex colorings of graphs

✍ Pierre Hansen; Alain Hertz; Julio Kuplinsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Graph coloring and monotone functions on

Graph coloring and monotone functions on posets

✍ Nathan Linial 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The purpose of this note is to point out a relationship between graph coloring and monotone functions defined on posets. This relationship permits us to deduce certain properties of the chromatic polynomial of a graph.

Polychromatic colorings of bounded degre

Polychromatic colorings of bounded degree plane graphs

✍ Elad Horev; Roi Krakovski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

## Abstract A __polychromatic k__‐__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro

Coloring Graphs without Short Non-boundi

Coloring Graphs without Short Non-bounding Cycles

✍ S. Fisk; B. Mohar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 357 KB

It is shown that there is a constant \(c\) such that if \(G\) is a graph embedded in a surface of genus \(g\) (either orientable or non-orientable) and the length of a shortest non-bounding cycle of \(G\) is at least \(c \log (g+1)\), then \(G\) is six-colorable. A similar result holds for three- an

Degree-bounded coloring of graphs: Varia

Degree-bounded coloring of graphs: Variations on a theme by brooks

✍ S. L. Hakimi; J. Mitchem; E. F. Schmeichel 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 876 KB

## Abstract A graph __G__ is degree‐bounded‐colorable (briefly, db‐colorable) if it can be properly vertex‐colored with colors 1,2, …, k ≤ Δ(__G__) such that each vertex __v__ is assigned a color __c__(__v__) ≤ __v__. We first prove that if a connected graph __G__ has a block which is neither a com

On bounded treewidth duality of graphs

✍ Ne?et?il, Jaroslav; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 734 KB

For a graph H , the H-coloring problem is to decide whether or not an instance graph G is homomorphic to H . The H-coloring problem is said to have bounded treewidth duality if there is an integer k such that for any graph G which is not homomorphic to H , there is a graph F of treewidth k which is