On stable cutsets in line graphs
From MaRDI portal
Publication:1400002
DOI10.1016/S0304-3975(03)00048-3zbMATH Open1022.68102MaRDI QIDQ1400002FDOQ1400002
Authors: Van Bang Le, Bert Randerath 
Publication date: 30 July 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Decomposition by clique separators
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Title not available (Why is that?)
- Title not available (Why is that?)
- On stable cutsets in graphs
- Title not available (Why is that?)
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Matching cutsets in graphs
- An algorithm for finding clique cut-sets
- Recognizing decomposable graphs
- A note on fragile graphs
- Coloring graphs with stable cutsets
- Stable set bonding in perfect graphs and parity graphs
Cited In (26)
- Algorithms Solving the Matching Cut Problem
- Extremal graphs having no matching cuts
- Improper C-colorings of graphs
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- 3-consecutive edge coloring of a graph
- Graph-Theoretic Concepts in Computer Science
- Title not available (Why is that?)
- Maximum number of colors: C-coloring and related problems
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius
- Algorithms solving the matching cut problem
- Satisfactory graph partition, variants, and generalizations
- Matching cutsets in graphs of diameter 2
- Title not available (Why is that?)
- Exact and parameterized algorithms for the independent cutset problem
- The complexity of the matching-cut problem for planar graphs and other graph classes
- The complexity of the perfect matching-cut problem
- Covering graphs with convex sets and partitioning graphs into convex sets
- On stable cutsets in graphs
- 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
- On the stable degree of graphs
- On stable cutsets in claw-free graphs and planar graphs
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- Matching cut in graphs with large minimum degree
- Finding matching cuts in \(H\)-free graphs
This page was built for publication: On stable cutsets in line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400002)
