Complexity of choosing subsets from color sets
From MaRDI portal
Publication:1584428
DOI10.1016/S0012-365X(98)00101-0zbMath0956.05095OpenAlexW2053705828MaRDI QIDQ1584428
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
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
A note on not-4-list colorable planar graphs ⋮ Single‐conflict colouring ⋮ DP-colorings of hypergraphs ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs
Cites Work
- The complexity of planar graph choosability
- Precoloring extension. I: Interval graphs
- Algorithmic complexity of list colorings
- Choosability and fractional chromatic numbers
- What we know and what we do not know about Turán numbers
- Graph colorings with local constraints -- a survey
- Precoloring Extension III: Classes of Perfect Graphs
- 25 pretty graph colouring problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of choosing subsets from color sets
