The list partition problem for graphs
From MaRDI portal
Publication:5501285
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cited in
(21)- The Complexity of the List Partition Problem for Graphs
- Clique and anticlique partitions of graphs
- Two algorithms for general list matrix partitions
- Matrix partitions of perfect graphs
- The polynomial dichotomy for three nonempty part sandwich problems
- scientific article; zbMATH DE number 3963195 (Why is no real title available?)
- Parallelizing a new algorithm for the set partition problem
- Colouring, constraint satisfaction, and complexity
- Clique and anticlique partitions of graphs
- Matrix Partitions with Finitely Many Obstructions
- List monopolar partitions of claw-free graphs
- scientific article; zbMATH DE number 1744077 (Why is no real title available?)
- Solving partition problems almost always requires pushing many vertices around
- Extended skew partition problem
- Counting List Matrix Partitions of Graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- 2K2 vertex-set partition into nonempty parts
- The polynomial dichotomy for three nonempty part sandwich problems
- Complexity of graph partition problems
- LATIN 2004: Theoretical Informatics
- List matrix partitions of chordal graphs
This page was built for publication: The list partition problem for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501285)
