Finding matching cuts in \(H\)-free graphs
From MaRDI portal
Publication:6046951
DOI10.1007/s00453-023-01137-9arXiv2207.07095OpenAlexW4379796487MaRDI QIDQ6046951
Daniël Paulusma, Felicia Lucke, Bernard Ries
Publication date: 6 October 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.07095
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new characterization of \(P_k\)-free graphs
- Computing vertex-surjective homomorphisms to partially reflexive trees
- The structure of bull-free graphs II and III -- a summary
- Algorithms solving the matching cut problem
- Matching cutsets in graphs of diameter 2
- A new characterization of \(P_{6}\)-free graphs
- On stable cutsets in line graphs
- 2-factor Hamiltonian graphs.
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- Disconnected 2-factors in planar cubic bridgeless graphs
- Vertex colouring and forbidden subgraphs -- a survey
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Hard problems that quickly become very easy
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
- A note on matching-cut in \(P_t\)-free graphs
- An FPT algorithm for matching cut and d-cut
- Vertex partitioning problems on graphs with bounded tree width
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Domination When the Stars Are Out
- Recognizing decomposable graphs
- The complexity of the matching-cut problem for planar graphs and other graph classes
- Networks immune to isolated line failures
- Clique-width for hereditary graph classes
- Matching cutsets in graphs
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- Good edge-labelling of graphs
- The perfect matching cut problem revisited
- Matching cut in graphs with large minimum degree
- Contracting to a longest path in H-free graphs
This page was built for publication: Finding matching cuts in \(H\)-free graphs
