Perfect matching cuts partitioning a graph into complementary subgraphs
From MaRDI portal
Publication:2169960
Cites work
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Algorithms solving the matching cut problem
- Clique cycle transversals in graphs with few \(P_{4}\)'s
- Complement reducible graphs
- Complexity properties of complementary prisms
- Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
- Decycling with a matching
- Graph theory with applications
- Graphs in which some and every maximum matching is uniquely restricted
- scientific article; zbMATH DE number 1202982 (Why is no real title available?)
- scientific article; zbMATH DE number 2044946 (Why is no real title available?)
- Maximum induced matchings close to maximum matchings
- Minimal separators in extended \(P_4\)-laden graphs
- On testing isomorphism of permutation graphs
- On the Cutwidth and the Topological Bandwidth of a Tree
- Partitioning a graph into complementary subgraphs
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets
- Recognizing some complementary products
- Remarks on k-clique, k-independent set and 2-contamination in complementary prisms
- The complementary product of two graphs
This page was built for publication: Perfect matching cuts partitioning a graph into complementary subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169960)
