Exploring the complexity boundary between coloring and list-coloring
From MaRDI portal
Recommendations
Cites work
- Approximation results for the optimum cost chromatic partition problem
- Clustering and domination in perfect graphs
- Distance-hereditary graphs
- Dominating sets for split and bipartite graphs
- Exploring the complexity boundary between coloring and list-coloring
- Generalized coloring for tree-like graphs
- Graph Classes: A Survey
- Graph colorings with local constraints -- a survey
- scientific article; zbMATH DE number 5158493 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 772760 (Why is no real title available?)
- On Representatives of Subsets
- On the complexity of certain completion problems
- Precoloring Extension III: Classes of Perfect Graphs
- Precoloring extension on unit interval graphs
- Precoloring extension. I: Interval graphs
- Some results concerning the complexity of restricted colorings of graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The Complexity of Coloring Circular Arcs and Chords
- The complexity of completing partial Latin squares
- The ellipsoid method and its consequences in combinatorial optimization
- The NP-Completeness of Edge-Coloring
Cited in
(21)- Algorithmic complexity of list colorings
- Polyhedral studies of vertex coloring problems: the standard formulation
- A branch and price algorithm for list coloring problem
- Closing complexity gaps for coloring problems on \(H\)-free graphs
- On the complexity of restoring corrupted colorings
- Limited packing and multiple domination problems: polynomial time reductions
- Pickup and delivery problems with autonomous vehicles on rings
- Open problems on graph coloring for special graph classes
- Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
- Between coloring and list-coloring: -coloring.
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- An exact decomposition approach for the real-time train dispatching problem
- Incremental list coloring of graphs, parameterized by conservation
- Restricted coloring problems on graphs with few P₄'s
- Space complexity of list H-colouring: a dichotomy
- On coloring problems with local constraints
- On coloring problems with local constraints
- Exploring the complexity boundary between coloring and list-coloring
- On the graphs with distinguishing number equal list distinguishing number
- Aspects of the complexity of (,)-coloring
- On the complexity of the minimum chromatic violation problem
This page was built for publication: Exploring the complexity boundary between coloring and list-coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896984)
