✦ LIBER ✦

On a problem concerning ordered colourings

✍ Scribed by Louis Caccetta; Rui Zhong Jia

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 192 KB
Volume: 190
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00149-6

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a connected graph with v(G)>~2 vertices and independence number ~(G). G is critical if for any edge e of G: (i) ~(G -e) > ct(G), if e is not a cut edge of G, and

, 2, ife is a cut edge and Gi, G2 are the two components of G-e.

📜 SIMILAR VOLUMES

A ramsey type problem concerning vertex

A ramsey type problem concerning vertex colourings

✍ Jason I Brown; Vojtěch Rödl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 475 KB

On ordered sets without 2-colourings

✍ Zbigniew Lonc 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 829 KB

We say that an ordered set has a k-coloring if its elements can be colored with k colors such that no maximal nontrivial antichain is monochromatic. It was shown by Duffus, Kierstead and Trotter that each ordered set has a 3-coloring. Very few examples of ordered sets not admitting 2-colorings have

On a problem concerning spacings

✍ Shihong Cheng 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 500 KB

On a problem concerning tolerance graphs

✍ Thomas Andreae; Ulf Hennig; Andreas Parra 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 406 KB

On a problem concerning harmonic measure

✍ James A. Jenkins 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 French ⚖ 240 KB

On a graph colouring problem

✍ Maurice Cochand; Gyula Károlyi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 196 KB