✦ LIBER ✦

Graph coloring and monotone functions on posets

✍ Scribed by Nathan Linial

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 79 KB
Volume: 58
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90191-3

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Bounded color functions on graphs

✍ D. W. Matula 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 753 KB

Parallel and On-Line Graph Coloring

✍ Magnus M Halldórsson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 209 KB

We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and on-line computing. We present a randomized on-line Ž . coloring algorithm with a performance ratio of O nrlog n , an improvement of log n factor over the previous best known algorithm of Vishwanathan

Some theorems on graphs and posets

✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 800 KB

In this journal, Lcclerc proved that the dimension of the partiailly ordered slet consisting of all subf~ce'~ of a tree T, m&red by inclusion, is the number of end yuints of 'I'. Leclerc posed the probkrn of determitAng the dimension the partially ed set P consisting of all inducxxI connected subgra

On vertex partitions and some minor-mono

On vertex partitions and some minor-monotone graph parameters

✍ D. Gonçalves 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

We study vertex partitions of graphs according to some minormonotone graph parameters. Ding et al. [J Combin Theory Ser B 79(2) (2000), 221-246] proved that some minor-monotone parameters are such that, any graph G with (G) ≥ 2 admits a vertex partition into two graphs with parameter at most (G)-1.

On the partition and coloring of a graph

On the partition and coloring of a graph by cliques

✍ W.D. Wallis; Guo-Hui Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Wallis, W.D. and G.-H. Zhang, On the partition and coloring of a graph by cliques, Discrete Mathematics 120 (1993) 191-203. We first introduce the concept of the k-chromatic index of a graph, and then discuss some of its properties. A characterization of the clique partition number of the graph G V

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using