𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equipartite colorings in graphs and hypergraphs

✍ Scribed by C Berge; F Sterboul

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
853 KB
Volume
22
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On splittable colorings of graphs and hy
On splittable colorings of graphs and hypergraphs
✍ Zoltán Füredi; Radhika Ramamurthi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an

Coloring Face-Hypergraphs of Graphs on S
Coloring Face-Hypergraphs of Graphs on Surfaces
✍ André Kündgen; Radhika Ramamurthi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 223 KB

The face-hypergraph, H(G), of a graph G embedded in a surface has vertex set V(G), and every face of G corresponds to an edge of H(G) consisting of the vertices incident to the face. We study coloring parameters of these embedded hypergraphs. A hypergraph is k-colorable (k-choosable) if there is a c

Applications of hypergraph coloring to c
Applications of hypergraph coloring to coloring graphs not inducing certain trees
✍ H.A. Kierstead; V. Rodl 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 385 KB

We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees. ## O. Introduction A class of graphs F is said to be x-bounded if there exists a functionfsuch that for all graphs G e F, (.) z(G) <~f(og(G)), where

Sparse color-critical graphs and hypergr
Sparse color-critical graphs and hypergraphs with no short cycles
✍ H. L. Abbott; B. Zhou; D. R. Hare 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 709 KB

## Abstract We give constructions of color‐critical graphs and hypergraphs with no short cycles and with relatively few edges. In particular, we show that, for each __n__ ≧ 3, the smallest number of edges in a 3‐critical triangle‐free __n__‐graph (hypergraph) with __m__ vertices is __m__ + __o(m)__