Stable set bonding in perfect graphs and parity graphs
From MaRDI portal
Publication:1321990
DOI10.1006/jctb.1993.1049zbMath0793.05119OpenAlexW2082173549MaRDI QIDQ1321990
Jean Fonlupt, Derek Gordon Corneil
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
Related Items (11)
On edge perfectness and classes of bipartite graphs ⋮ Algorithms Solving the Matching Cut Problem ⋮ On stable cutsets in line graphs ⋮ Algorithms solving the matching cut problem ⋮ Finding induced paths of given parity in claw-free graphs ⋮ On stable cutsets in claw-free graphs and planar graphs ⋮ Matching cutsets in graphs of diameter 2 ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ On stable cutsets in graphs ⋮ Bisplit graphs ⋮ Minimal antichains in well-founded quasi-orders with an application to tournaments
This page was built for publication: Stable set bonding in perfect graphs and parity graphs
