Color-bounded hypergraphs. V: Host graphs and subdivisions

DOI10.7151/DMGT.1541zbMATH Open1234.05078OpenAlexW2073094506MaRDI QIDQ3089348FDOQ3089348

Authors: Csilla Bujtás, Zsolt Tuza, V. I. Voloshin 

Publication date: 24 August 2011

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1541

Recommendations

• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• scientific article; zbMATH DE number 1839477

zbMATH Keywords

hypertreevertex coloringfeasible setmixed hypergrapharboreal hypergraphcolor-bounded hypergraphhost graphedge subdivision

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cited In (6)

• On perfection and imperfection of one-realizations of a given set
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• On the structure of uniform one-realizations of a given set
• The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
• Constrained colouring and \(\sigma\)-hypergraphs

This page was built for publication: Color-bounded hypergraphs. V: Host graphs and subdivisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089348)