✦ LIBER ✦

The strong chromatic number of partial triple systems

✍ Scribed by Charles J. Colbourn; Dieter Jungnickel; Alexander Rosa

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 794 KB
Volume: 20
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90039-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Star chromatic numbers of hypergraphs an

Star chromatic numbers of hypergraphs and partial Steiner triple systems

✍ L. Haddad; H. Zhou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 635 KB

The concept of star chromatic number of a graph, introduced by Vince ( ) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by . In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and

On the chromatic numbers of Steiner trip

On the chromatic numbers of Steiner triple systems

✍ Lucien Haddad 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

Geometric properties are used to determine the chromatic number of AG(4, 3) and to derive some important facts on the chromatic number of PG(n, 2). It is also shown that a 4-chromatic STS(v) exists for every admissible order v ≥ 21.

Upper chromatic number of Steiner triple

Upper chromatic number of Steiner triple and quadruple systems

✍ Lorenzo Milazzo; Zsolt Tuza 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 630 KB

An improved bound for the strong chromat

An improved bound for the strong chromatic number

✍ P. E. Haxell 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 1 views

## Abstract Let η > 0 be given. Then there exists __d__~0~ = __d__~0~(η) such that the following holds. Let __G__ be a finite graph with maximum degree at most __d__ ≥ __d__~0~ whose vertex set is partitioned into classes of size α __d__, where α≥ 11/4 + η. Then there exists a proper coloring of __

Maximal antiramsey graphs and the strong

Maximal antiramsey graphs and the strong chromatic number

✍ S. A. Burr; P. Erdös; R. L. Graham; V. T. Sós 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 916 KB

A typical problem arising in Ramsey graph theory is the following. For given graphs G and L, how few colors can be used to color the edges of G in order that no monochromatic subgraph isomorphic to L is formed? In this paper w e investigate the opposite extreme. That is, w e will require that in any

Strong total chromatic numbers of comple

Strong total chromatic numbers of complete hypergraphs

✍ Peter Cowling 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We determine the strong total chromatic number of the complete h-uniform hypergraph Kh, and the complete h-partite hypergraph K,\* ............ .