Color-bounded hypergraphs, V: host graphs and subdivisions
Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 2, pp. 223-238

Voir la notice de l'article provenant de la source Library of Science

A color-bounded hypergraph is a hypergraph (set system) with vertex set X and edge set = E₁,...,Eₘ, together with integers s_i and t_i satisfying 1 ≤ s_i ≤ t_i ≤ |E_i| for each i = 1,...,m. A vertex coloring φ is proper if for every i, the number of colors occurring in edge E_i satisfies s_i ≤ |φ(E_i)| ≤ t_i. The hypergraph ℋ is colorable if it admits at least one proper coloring.
Keywords: mixed hypergraph, color-bounded hypergraph, vertex coloring, arboreal hypergraph, hypertree, feasible set, host graph, edge subdivision
@article{DMGT_2011_31_2_a1,
     author = {Bujt\'as, Csilla and Tuza, Zsolt and Voloshin, Vitaly},
     title = {Color-bounded hypergraphs, {V:} host graphs and subdivisions},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {223--238},
     publisher = {mathdoc},
     volume = {31},
     number = {2},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a1/}
}
TY  - JOUR
AU  - Bujtás, Csilla
AU  - Tuza, Zsolt
AU  - Voloshin, Vitaly
TI  - Color-bounded hypergraphs, V: host graphs and subdivisions
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2011
SP  - 223
EP  - 238
VL  - 31
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a1/
LA  - en
ID  - DMGT_2011_31_2_a1
ER  - 
%0 Journal Article
%A Bujtás, Csilla
%A Tuza, Zsolt
%A Voloshin, Vitaly
%T Color-bounded hypergraphs, V: host graphs and subdivisions
%J Discussiones Mathematicae. Graph Theory
%D 2011
%P 223-238
%V 31
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a1/
%G en
%F DMGT_2011_31_2_a1
Bujtás, Csilla; Tuza, Zsolt; Voloshin, Vitaly. Color-bounded hypergraphs, V: host graphs and subdivisions. Discussiones Mathematicae. Graph Theory, Tome 31 (2011) no. 2, pp. 223-238. http://geodesic.mathdoc.fr/item/DMGT_2011_31_2_a1/