Matching cutsets in graphs of diameter 2
From MaRDI portal
Publication:955037
DOI10.1016/j.tcs.2008.07.002zbMath1153.68037OpenAlexW1997541985MaRDI QIDQ955037
Katarzyna Jesse-Józefczyk, Mieczysław Borowiecki
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.002
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Vertex partitioning problems on graphs with bounded tree width ⋮ Algorithms Solving the Matching Cut Problem ⋮ Finding matching cuts in \(H\)-free graphs ⋮ Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms ⋮ Algorithms solving the matching cut problem ⋮ Improper C-colorings of graphs ⋮ \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs ⋮ Unnamed Item ⋮ 3-consecutive edge coloring of a graph ⋮ A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter ⋮ Satisfactory graph partition, variants, and generalizations ⋮ Matching cut in graphs with large minimum degree ⋮ On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Maximal and minimal vertex-critical graphs of diameter two
- Coloring graphs with stable cutsets
- Graphs of diameter two with no 4-circuits
- Modular decomposition and transitive orientation
- Stable set bonding in perfect graphs and parity graphs
- On stable cutsets in line graphs
- On stable cutsets in graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Size in maximal triangle-free graphs and minimal graphs of diameter 2
- Efficient and Practical Algorithms for Sequential Modular Decomposition
- Recognizing decomposable graphs
- Matching cutsets in graphs
This page was built for publication: Matching cutsets in graphs of diameter 2
