𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On colorings of non-uniform hypergraphs without short cycles

✍ Scribed by A.P. Rozovskaya; D.A. Shabanov

Book ID
119236642
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
206 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex colorings of graphs without short
Vertex colorings of graphs without short odd cycles
✍ Andrzej Dudek; Reshma Ramadurai πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

Motivated by the work of NeΕ‘etΕ™il and R ΓΆdl on "Partitions of vertices" we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and ord

Coloring Graphs without Short Non-boundi
Coloring Graphs without Short Non-bounding Cycles
✍ S. Fisk; B. Mohar πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 357 KB

It is shown that there is a constant \(c\) such that if \(G\) is a graph embedded in a surface of genus \(g\) (either orientable or non-orientable) and the length of a shortest non-bounding cycle of \(G\) is at least \(c \log (g+1)\), then \(G\) is six-colorable. A similar result holds for three- an