A strengthening of Ben Rebea's lemma
From MaRDI portal
Publication:1321993
DOI10.1006/jctb.1993.1052zbMath0793.05123OpenAlexW1974280710MaRDI QIDQ1321993
Publication date: 5 May 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.1052
Related Items (18)
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 ⋮ Claw‐free circular‐perfect graphs ⋮ Claw-free graphs---a survey ⋮ Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs ⋮ A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs ⋮ On weighted efficient total domination ⋮ Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs ⋮ Finding a smallest odd hole in a claw-free graph using global structure ⋮ A reduction algorithm for the weighted stable set problem in claw-free graphs ⋮ An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs ⋮ Measuring Indifference: Unit Interval Vertex Deletion ⋮ Gear composition and the stable set polytope ⋮ On stability of Hamilton-connectedness under the 2-closure in claw-free graphs ⋮ Claw-free circular-perfect graphs ⋮ Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ ⋮ Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition ⋮ Edge-distinguishing of star-free graphs ⋮ Minimal \(2\)-connected non-Hamiltonian claw-free graphs
This page was built for publication: A strengthening of Ben Rebea's lemma
