\(2K_2\)-partition of some classes of graphs

DOI10.1016/j.dam.2010.09.009zbMath1254.05153OpenAlexW1803866158MaRDI QIDQ1759842

Xianqiang Yang

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.09.009

zbMATH Keywords

complexitygraph classes\(2K_{2}\)-partition\(H\)-partition problem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Disconnected cuts in claw-free graphs ⋮ Unnamed Item ⋮ Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees ⋮ The computational complexity of disconnected cut and \(2 K_2\)-partition ⋮ Computing vertex-surjective homomorphisms to partially reflexive trees ⋮ On disconnected cuts and separators ⋮ Distinct edge geodetic decomposition in graphs

Cites Work

• Unnamed Item
• The strong perfect graph theorem
• Star-cutsets and perfect graphs
• A tree representation for \(P_ 4\)-sparse graphs
• A partial k-arboretum of graphs with bounded treewidth
• On the structure of graphs with few \(P_4\)s
• 2K2-Partition Problem
• 2K2 vertex-set partition into nonempty parts
• List Partitions
• FindingH-partitions efficiently
• P-Components and the Homogeneous Decomposition of Graphs
• Fast Skew Partition Recognition
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: \(2K_2\)-partition of some classes of graphs