On stable cutsets in claw-free graphs and planar graphs
DOI10.1016/J.JDA.2007.04.001zbMATH Open1154.05317OpenAlexW1970916146MaRDI QIDQ935842FDOQ935842
Authors: Van Bang Le, Raffaele Mosca, Haiko Müller 
Publication date: 8 August 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2007.04.001
Recommendations
- Graph-Theoretic Concepts in Computer Science
- On stable cutsets in graphs
- Stable sets in claw-free graphs: a journey through algorithms and polytopes
- On the Stable Set Polytope of Claw-Free Graphs
- scientific article; zbMATH DE number 2044944
- On stable cutsets in line graphs
- The stable set polytope of claw-free graphs with large stability number
- Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Clique-perfectness of claw-free planar graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Decomposition by clique separators
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Title not available (Why is that?)
- A special planar satisfiability problem and a consequence of its NP- completeness
- Title not available (Why is that?)
- New applications of clique separator decomposition for the maximum weight stable set problem
- List Partitions
- Algorithms on clique separable graphs
- 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
- On stable cutsets in line graphs
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
- Recognizing decomposable graphs
- A note on fragile graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coloring graphs with stable cutsets
- Networks immune to isolated line failures
- Stable set bonding in perfect graphs and parity graphs
- Fragile graphs with small independent cuts
- A Split&Push Approach to 3D Orthogonal Drawing
- The complexity of the matching-cut problem for planar graphs and other graph classes (extended abstract)
Cited In (16)
- Algorithms Solving the Matching Cut Problem
- Disconnected cuts in claw-free graphs
- Disconnected cuts in claw-free graphs
- Vertex partitioning problems on graphs with bounded tree width
- 3-consecutive edge coloring of a graph
- Graph-Theoretic Concepts in Computer Science
- On stable cutsets in line graphs
- Dominating induced matchings in graphs without a skew star
- Declawing a graph: polyhedra and branch-and-cut algorithms
- Algorithms solving the matching cut problem
- Satisfactory graph partition, variants, and generalizations
- Title not available (Why is that?)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- Exact and parameterized algorithms for the independent cutset problem
- On stable cutsets in graphs
- Minimal disconnected cuts in planar graphs
This page was built for publication: On stable cutsets in claw-free graphs and planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935842)
