Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
DOI10.1016/J.DISC.2012.09.020zbMATH Open1277.05059DBLPjournals/dm/BujtasT13OpenAlexW2076597551WikidataQ59072528 ScholiaQ59072528MaRDI QIDQ383764FDOQ383764
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
Recommendations
chromatic numberfeasible setmixed hypergraphupper chromatic numberhypergraph coloringalgorithmic complexitycolor-bounded hypergraphinterval hypergraphstably bounded hypergraph
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)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Trivially perfect graphs
- The Comparability Graph of a Tree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coloring mixed hypergraphs: theory, algorithms and applications
- Color-bounded hypergraphs. I: General results
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
- Mixed interval hypergraphs
- Uncolorable mixed hypergraphs
- Color-bounded hypergraphs. V: Host graphs and subdivisions
- Color-bounded hypergraphs, III: model comparison
- Chromatic polynomials of hypergraphs
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees
- A generalization of edge-coloring in graphs
- Tight approximations for resource constrained scheduling and bin packing
- Edge-Coloring and f-Coloring for Various Classes of Graphs
- Title not available (Why is that?)
- SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
- Title not available (Why is that?)
- Chromatic properties of co-monostars
- A Note on "The Comparability Graph of a Tree"
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
- Mixed hypergraphs and beyond
- Color-bounded hypergraphs. V: Host graphs and subdivisions
- 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)
