𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Oriented hypergraphs, stability numbers and chromatic numbers

✍ Scribed by Heinrich Müller

Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
232 KB
Volume
34
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Oriented hypergraphs are defined, so that it is possible to genc&ze popositions characterizing the chromatic number and the stability number of a graph by means of crientations i!tnd elementary paths, to the strong and weak chromatic number and the strong and we& stability number of a hypergraph.

📜 SIMILAR VOLUMES

The chromatic numbers of random hypergra
The chromatic numbers of random hypergraphs
✍ Michael Krivelevich; Benny Sudakov 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

For a pair of integers 1 F ␥r, the ␥-chromatic number of an r-uniform Ž . hypergraph H s V, E is the minimal k, for which there exists a partition of V into subsets < < T, . . . , T such that e l T F ␥ for every e g E. In this paper we determine the asymptotic 1 k i Ž . behavior of the ␥-chromatic n

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,\* ............ .

Chromatic numbers of hypergraphs and cov
Chromatic numbers of hypergraphs and coverings of graphs
✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization

Acyclic and oriented chromatic numbers o
Acyclic and oriented chromatic numbers of graphs
✍ Kostochka, A. V.; Sopena, E.; Zhu, X. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

The oriented chromatic number χ o ( G) of an oriented graph G = (V, A) is the minimum number of vertices in an oriented graph H for which there exists a homomorphism of G to H. The oriented chromatic number χ o (G) of an undirected graph G is the maximum of the oriented chromatic numbers of all the

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

Chromatic number of finite and infinite
Chromatic number of finite and infinite graphs and hypergraphs
✍ Paul Erdös; Andras Hajnal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 349 KB

We wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and Szemer6di, and posed many problems some of which turned out to be undecidable. In this survey we state some old and new solved and unsolved problems. Nous avons 6crit beaucoup d'articles, certains en collabo