The list partition problem for graphs

zbMATH Open1318.05072MaRDI QIDQ5501285FDOQ5501285

Authors: Kathie Cameron, Elaine M. Eschen, R. Sritharan, Chính T. Hoàng 

Publication date: 3 August 2015

Recommendations

• The Complexity of the List Partition Problem for Graphs
• List Partitions
• Publication:4508373
• Complexity of graph partition problems
• Generalized partitions of graphs

Mathematics Subject Classification ID

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)

Cited In (21)

• Clique and anticlique partitions of graphs
• The Complexity of the List Partition Problem for Graphs
• Two algorithms for general list matrix partitions
• Matrix partitions of perfect graphs
• The polynomial dichotomy for three nonempty part sandwich problems
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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)