Complexity of choosing subsets from color sets
From MaRDI portal
Publication:1584428
DOI10.1016/S0012-365X(98)00101-0zbMATH Open0956.05095OpenAlexW2053705828MaRDI QIDQ1584428FDOQ1584428
Authors: Zsolt Tuza, Margit Voigt, Jan Kratochvíl 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00101-0
Recommendations
- Algorithmic complexity of list colorings
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
- The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
- On the complexity of the selective graph coloring problem in some special classes of graphs
- scientific article; zbMATH DE number 3889547
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- What we know and what we do not know about Turán numbers
- Title not available (Why is that?)
- Graph colorings with local constraints -- a survey
- 25 pretty graph colouring problems
- Choosability and fractional chromatic numbers
- Multicriterial graph problems with MAXMIN criterion
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of planar graph choosability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Precoloring extension. I: Interval graphs
- Precoloring Extension III: Classes of Perfect Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic complexity of list colorings
Cited In (4)
This page was built for publication: Complexity of choosing subsets from color sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584428)
