Stable set bonding in perfect graphs and parity graphs

DOI10.1006/JCTB.1993.1049MaRDI QIDQ1321990zbMATH OpenOpenAlexFDO

Authors Derek G. Corneil, Jean Fonlupt

Publication date 10 August 1994

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1993.1049

zbMATH Keywords

independent setsperfect graphscomposition operationstable setsparity graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• The stable set polytope and some operations on graphs
• scientific article; zbMATH DE number 3887730
• Compositions for perfect graphs
• Decomposition of perfect graphs
• Compositions of Graphs and Polyhedra II: Stable Sets

Cited in

(19)

• Minimal antichains in well-founded quasi-orders with an application to tournaments
• THE GENERALIZED STABLE SET PROBLEM FOR PERFECT BIDIRECTED GRAPHS
• Algorithms Solving the Matching Cut Problem
• scientific article; zbMATH DE number 2196278 (Why is no real title available?)
• Decomposition of perfect graphs
• Bisplit graphs
• On stable cutsets in line graphs
• A class of h-perfect graphs
• On edge perfectness and classes of bipartite graphs
• Algorithms solving the matching cut problem
• The stable set polytope and some operations on graphs
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• Matching cutsets in graphs of diameter 2
• Compositions for perfect graphs
• Exact and parameterized algorithms for the independent cutset problem
• On stable cutsets in graphs
• On stable cutsets in claw-free graphs and planar graphs
• scientific article; zbMATH DE number 3887730 (Why is no real title available?)
• Finding induced paths of given parity in claw-free graphs

This page was built for publication: Stable set bonding in perfect graphs and parity graphs

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