scientific article; zbMATH DE number 1161313

MaRDI QIDQ4393307zbMATH OpenFDO

Authors Sulamita Klein, Celina M. H. de Figueiredo

Publication date 5 October 1998

zbMATH Keywords

perfect graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On stable cutsets in graphs
• The computational complexity of disconnected cut and \(2 K_2\)-partition
• The Complexity of the List Partition Problem for Graphs
• scientific article; zbMATH DE number 2044944
• Complexity of graph partition problems

Cited in

(22)

• On stable cutsets in line graphs
• On stable cutsets in graphs
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Stable skew partition problem
• Vertex partitioning problems on graphs with bounded tree width
• Skew partitions in perfect graphs
• The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
• Graph partitions with prescribed patterns
• Bisplit graphs
• Algorithms Solving the Matching Cut Problem
• Obstructions to partitions of chordal graphs
• scientific article; zbMATH DE number 2230229 (Why is no real title available?)
• The polynomial dichotomy for three nonempty part sandwich problems
• 3-consecutive edge coloring of a graph
• On polynomial kernelization for stable cutset
• Revisiting extremal graphs having no stable cutsets
• Forest cuts in sparse graphs
• On polynomial kernelization for stable cutset
• Digraph matrix partitions and trigraph homomorphisms
• A new characterization of unichord-free graphs
• Algorithms solving the matching cut problem
• On stable cutsets in claw-free graphs and planar graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393307)