The list partition problem for graphs
From MaRDI portal
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) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(22)- Generalized partitions of graphs
- Clique and anticlique partitions of graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- Extended skew partition problem
- Matrix partitions of perfect graphs
- Parallelizing a new algorithm for the set partition problem
- Complexity of graph partition problems
- Two algorithms for general list matrix partitions
- Counting List Matrix Partitions of Graphs
- Matrix Partitions with Finitely Many Obstructions
- 2K2 vertex-set partition into nonempty parts
- The Complexity of the List Partition Problem for Graphs
- scientific article; zbMATH DE number 3963195 (Why is no real title available?)
- List monopolar partitions of claw-free graphs
- scientific article; zbMATH DE number 1744077 (Why is no real title available?)
- Colouring, constraint satisfaction, and complexity
- Solving partition problems almost always requires pushing many vertices around
- The polynomial dichotomy for three nonempty part sandwich problems
- The polynomial dichotomy for three nonempty part sandwich problems
- LATIN 2004: Theoretical Informatics
- Clique and anticlique partitions of graphs
- 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)
