Color-bounded hypergraphs. VI: Structural and functional jumps in complexity

DOI10.1016/J.DISC.2012.09.020MaRDI QIDQ383764zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Csilla Bujtás, Zsolt Tuza

Publication date 6 December 2013

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2012.09.020

zbMATH Keywords

chromatic numberfeasible setmixed hypergraphupper chromatic numberhypergraph coloringalgorithmic complexitycolor-bounded hypergraphinterval hypergraphstably bounded hypergraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs. V: Host graphs and subdivisions
• Color-bounded hypergraphs, III: model comparison

Cites work

• scientific article; zbMATH DE number 3503283 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1301963 (Why is no real title available?)
• scientific article; zbMATH DE number 1947044 (Why is no real title available?)
• scientific article; zbMATH DE number 786134 (Why is no real title available?)
• A Note on "The Comparability Graph of a Tree"
• A generalization of edge-coloring in graphs
• Chromatic polynomials of hypergraphs
• Chromatic properties of co-monostars
• Color-bounded hypergraphs, III: model comparison
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. I: General results
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Color-bounded hypergraphs. V: Host graphs and subdivisions
• Coloring mixed hypergraphs: theory, algorithms and applications
• Edge-Coloring and f-Coloring for Various Classes of Graphs
• Graph Classes: A Survey
• Mixed interval hypergraphs
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
• The Comparability Graph of a Tree
• Tight approximations for resource constrained scheduling and bin packing
• Trivially perfect graphs
• Uncolorable mixed hypergraphs

Cited in

(10)

• On perfection and imperfection of one-realizations of a given set
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• On the structure of uniform one-realizations of a given set
• More results on the smallest one-realization of a given set. II
• Color-bounded hypergraphs, III: model comparison
• Color-bounded hypergraphs. V: Host graphs and subdivisions
• Mixed hypergraphs and beyond
• Problems on cycles and colorings
• Constrained colouring and \(\sigma\)-hypergraphs

This page was built for publication: Color-bounded hypergraphs. VI: Structural and functional jumps in complexity

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