scientific article; zbMATH DE number 1161313

zbMath0897.68070MaRDI QIDQ4393307

Sulamita Klein, Celina M. Herrera de Figueiredo

Publication date: 5 October 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

perfect graph

Mathematics Subject Classification ID

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

Related Items (18)

Stable skew partition problem ⋮ Digraph matrix partitions and trigraph homomorphisms ⋮ Vertex partitioning problems on graphs with bounded tree width ⋮ Obstructions to partitions of chordal graphs ⋮ Algorithms Solving the Matching Cut Problem ⋮ A new characterization of unichord-free graphs ⋮ On stable cutsets in line graphs ⋮ Algorithms solving the matching cut problem ⋮ 3-consecutive edge coloring of a graph ⋮ On stable cutsets in claw-free graphs and planar graphs ⋮ The polynomial dichotomy for three nonempty part sandwich problems ⋮ The P versus NP-complete dichotomy of some challenging problems in graph theory ⋮ Skew partitions in perfect graphs ⋮ The sandwich problem for cutsets: clique cutset, \(k\)-star cutset ⋮ Graph partitions with prescribed patterns ⋮ Unnamed Item ⋮ On stable cutsets in graphs ⋮ Bisplit graphs

This page was built for publication: