Color-bounded hypergraphs, V: host graphs and subdivisions
Csilla Bujtás, Zsolt Tuza, Vitaly Voloshin (2011)
Discussiones Mathematicae Graph Theory
Similarity:
A color-bounded hypergraph is a hypergraph (set system) with vertex set X and edge set = E₁,...,Eₘ, together with integers and satisfying for each i = 1,...,m. A vertex coloring φ is proper if for every i, the number of colors occurring in edge satisfies . The hypergraph ℋ is colorable if it admits at least one proper coloring. We consider hypergraphs ℋ over a “host graph”, that means a graph G on the same vertex set X as ℋ, such that each induces a connected subgraph in G....