AI Chat AI Image Generator AI Video Text to Speech

A note on Matching-Cut in P_t-free Graphs

11/23/2021

∙

by Carl Feghali, et al.

∙

∙

A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of Matching-Cut for graphs without a fixed path as an induced subgraph. We show that Matching-Cut is in P for P_5-free graphs, but that there exists an integer t > 0 for which it is NP-complete for P_t-free graphs.

page 1

page 2

page 3

page 4

research

∙ 07/14/2022

Finding Matching Cuts in H-Free Graphs

The NP-complete problem Matching Cut is to decide if a graph has a match...

0 Felicia Lucke, et al. ∙

research

∙ 11/22/2022

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs

We show that Edge Multiway Cut (also called Multiterminal Cut) and Node ...

0 Matthew Alastair Johnson, et al. ∙

research

∙ 10/19/2020

The Graphs of Stably Matchable Pairs

We study the graphs formed from instances of the stable matching problem...

0 David Eppstein, et al. ∙

research

∙ 12/28/2020

Square-Cut Pizza Sharing is PPA-complete

We study the computational complexity of computing solutions for the squ...

0 Argyrios Deligkas, et al. ∙

research

∙ 04/30/2018

A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter

In a graph, a matching cut is an edge cut that is a matching. Matching C...

0 Hoang-Oanh Le, et al. ∙

research

∙ 10/19/2020

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

In rendez-vous protocols an arbitrarily large number of indistinguishabl...

0 A. R. Balasubramanian, et al. ∙

research

∙ 04/18/2019

New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching

Graphs are widely used to model complicated data semantics in many appli...

0 Mosab Hassaan, et al. ∙