On stable cutsets in graphs
From MaRDI portal
DOI10.1016/S0166-218X(00)00197-9zbMATH Open0962.68138OpenAlexW1967755743MaRDI QIDQ1582067FDOQ1582067
Authors: Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, Thomas Szymczak 
Publication date: 13 June 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00197-9
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Graph Classes: A Survey
- The complexity of satisfiability problems
- On rigid circuit graphs
- Representation of a finite graph by a set of intervals on the real line
- Asteroidal Triple-Free Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of graph partition problems
- Title not available (Why is that?)
- Finding large holes
- Matching cutsets in graphs
- An algorithm for finding clique cut-sets
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- Recognizing decomposable graphs
- On brittle graphs
- Coloring graphs with stable cutsets
- Stable set bonding in perfect graphs and parity graphs
Cited In (31)
- On spectral bounds for cutsets
- Algorithms Solving the Matching Cut Problem
- Title not available (Why is that?)
- On equistable, split, CIS, and related classes of graphs
- Vertex partitioning problems on graphs with bounded tree width
- Title not available (Why is that?)
- Cutsets in perfect and minimal imperfect graphs
- Bisplit graphs
- The computational complexity of disconnected cut and \(2 K_2\)-partition
- 3-consecutive edge coloring of a graph
- Galaxy cutsets in graphs
- Graph-Theoretic Concepts in Computer Science
- The P versus NP-complete dichotomy of some challenging problems in graph theory
- On stable cutsets in line graphs
- Stable skew partition problem
- Title not available (Why is that?)
- The complexity of list edge-partitions for simple graphs
- 3-colouring AT-free graphs in polynomial time
- A new characterization of unichord-free graphs
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
- Algorithms solving the matching cut problem
- Parameterizing cut sets in a graph by the number of their components
- The sandwich problem for decompositions and almost monotone properties
- Matching cutsets in graphs of diameter 2
- Title not available (Why is that?)
- Exact and parameterized algorithms for the independent cutset problem
- The polynomial dichotomy for three nonempty part sandwich problems
- Extremal graphs having no stable cutset
- The complexity of the matching-cut problem for planar graphs and other graph classes
- On stable cutsets in claw-free graphs and planar graphs
- Minimal disconnected cuts in planar graphs
This page was built for publication: On stable cutsets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582067)
