Matches in SemOpenAlex for { <https://semopenalex.org/work/W4384115382> ?p ?o ?g. }
Showing items 1 to 57 of
57
with 100 items per page.
- W4384115382 abstract "In a graph, a (perfect) matching cut is an edge cut that is a (perfect) matching. Matching Cut (MC), respectively, Perfect Matching Cut (PMC), is the problem of deciding whether a given graph has a matching cut, respectively, a perfect matching cut. The Disconnected Perfect Matching problem (DPM) is to decide if a graph has a perfect matching that contains a matching cut. Solving an open problem recently posed in [Lucke, Paulusma, Ries (ISAAC 2022), and Feghali, Lucke, Paulusma, Ries (arXiv:2212.12317)], we show that PMC is NP-complete in graphs without induced 14-vertex path $P_{14}$. Our reduction also works simultaneously for MC and DPM, improving the previous hardness results of MC on $P_{19}$-free graphs and of DPM on $P_{23}$-free graphs to $P_{14}$-free graphs for both problems. Actually, we prove a slightly stronger result: within $P_{14}$-free graphs, it is hard to distinguish between (i) those without matching cuts and those in which every matching cut is a perfect matching cut, (ii) those without perfect matching cuts and those in which every matching cut is a perfect matching cut, and (iii) those without disconnected perfect matchings and those in which every matching cut is a perfect matching cut. Moreover, assuming the Exponential Time Hypothesis, none of these problems can be solved in time $2^{o(n)}$ for $n$-vertex $P_{14}$-free input graphs. We also consider the problems in graphs without long induced cycles. It is known that MC is polynomially solvable in graphs without induced cycles of length at least 5 [Moshi (JGT 1989)]. We point out that the same holds for DPM." @default.
- W4384115382 created "2023-07-13" @default.
- W4384115382 creator A5007008004 @default.
- W4384115382 creator A5072055012 @default.
- W4384115382 date "2023-07-11" @default.
- W4384115382 modified "2023-09-27" @default.
- W4384115382 title "Complexity results for matching cut problems in graphs without long induced paths" @default.
- W4384115382 doi "https://doi.org/10.48550/arxiv.2307.05402" @default.
- W4384115382 hasPublicationYear "2023" @default.
- W4384115382 type Work @default.
- W4384115382 citedByCount "0" @default.
- W4384115382 crossrefType "posted-content" @default.
- W4384115382 hasAuthorship W4384115382A5007008004 @default.
- W4384115382 hasAuthorship W4384115382A5072055012 @default.
- W4384115382 hasBestOaLocation W43841153821 @default.
- W4384115382 hasConcept C105795698 @default.
- W4384115382 hasConcept C114614502 @default.
- W4384115382 hasConcept C118615104 @default.
- W4384115382 hasConcept C132525143 @default.
- W4384115382 hasConcept C165064840 @default.
- W4384115382 hasConcept C165526019 @default.
- W4384115382 hasConcept C170903109 @default.
- W4384115382 hasConcept C197657726 @default.
- W4384115382 hasConcept C203776342 @default.
- W4384115382 hasConcept C33923547 @default.
- W4384115382 hasConcept C43517604 @default.
- W4384115382 hasConcept C72545166 @default.
- W4384115382 hasConcept C80899671 @default.
- W4384115382 hasConceptScore W4384115382C105795698 @default.
- W4384115382 hasConceptScore W4384115382C114614502 @default.
- W4384115382 hasConceptScore W4384115382C118615104 @default.
- W4384115382 hasConceptScore W4384115382C132525143 @default.
- W4384115382 hasConceptScore W4384115382C165064840 @default.
- W4384115382 hasConceptScore W4384115382C165526019 @default.
- W4384115382 hasConceptScore W4384115382C170903109 @default.
- W4384115382 hasConceptScore W4384115382C197657726 @default.
- W4384115382 hasConceptScore W4384115382C203776342 @default.
- W4384115382 hasConceptScore W4384115382C33923547 @default.
- W4384115382 hasConceptScore W4384115382C43517604 @default.
- W4384115382 hasConceptScore W4384115382C72545166 @default.
- W4384115382 hasConceptScore W4384115382C80899671 @default.
- W4384115382 hasLocation W43841153821 @default.
- W4384115382 hasOpenAccess W4384115382 @default.
- W4384115382 hasPrimaryLocation W43841153821 @default.
- W4384115382 hasRelatedWork W1463991495 @default.
- W4384115382 hasRelatedWork W1998850476 @default.
- W4384115382 hasRelatedWork W2090200648 @default.
- W4384115382 hasRelatedWork W2579720493 @default.
- W4384115382 hasRelatedWork W2748469983 @default.
- W4384115382 hasRelatedWork W2798321768 @default.
- W4384115382 hasRelatedWork W3030295680 @default.
- W4384115382 hasRelatedWork W3179053635 @default.
- W4384115382 hasRelatedWork W4320022211 @default.
- W4384115382 hasRelatedWork W4379471579 @default.
- W4384115382 isParatext "false" @default.
- W4384115382 isRetracted "false" @default.
- W4384115382 workType "article" @default.