2K2-Partition Problem

DOI10.1016/J.ENDM.2005.06.031zbMATH Open1200.05166OpenAlexW1969073015MaRDI QIDQ3439337FDOQ3439337

Authors: C. N. Campos, Simone Dantas, Sylvain Gravier, Luerbio Faria 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.031

Recommendations

• 2K2 vertex-set partition into nonempty parts
• \(2K_{2}\) vertex-set partition into nonempty parts
• \(2K_2\)-partition of some classes of graphs
• The computational complexity of disconnected cut and \(2 K_2\)-partition
• The Complexity of the List Partition Problem for Graphs

zbMATH Keywords

computational complexitypartition problemsnp-completeness

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• The strong perfect graph theorem
• Complexity of graph partition problems
• Star-cutsets and perfect graphs
• Title not available (Why is that?)
• FindingH-partitions efficiently

Cited In (5)

• Degree-constrained 2-partitions of graphs
• \(2K_2\)-partition of some classes of graphs
• \(2K_{2}\) vertex-set partition into nonempty parts
• On a 2-dimensional equipartition problem
• 2K2 vertex-set partition into nonempty parts

This page was built for publication: 2K2-Partition Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439337)