𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On almost -degenerate -chromatic graphs and hypergraphs

✍ Scribed by Kostochka, Alexandr V.

Book ID
118271602
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
265 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

Game chromatic index of k-degenerate gra
Game chromatic index of k-degenerate graphs
✍ Leizhen Cai; Xuding Zhu πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 147 KB πŸ‘ 1 views