Stable set bonding in perfect graphs and parity graphs
From MaRDI portal
Publication:1321990
DOI10.1006/jctb.1993.1049zbMath0793.05119MaRDI QIDQ1321990
Derek Gordon 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
05C99: Graph theory
Related Items
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 line graphs, On stable cutsets in graphs, Minimal antichains in well-founded quasi-orders with an application to tournaments, On edge perfectness and classes of bipartite graphs, Finding induced paths of given parity in claw-free graphs, Bisplit graphs