Recommendations
Cited in
(20)- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
- Claw-free circular-perfect graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- Minimal \(2\)-connected non-Hamiltonian claw-free graphs
- Finding a smallest odd hole in a claw-free graph using global structure
- Claw-free graphs---a survey
- On weighted efficient total domination
- Edge-distinguishing of star-free graphs
- Claw-free circular-perfect graphs
- Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Gear composition and the stable set polytope
- The strength of the \(\Delta\)-system lemma
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs
- Measuring indifference: unit interval vertex deletion
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
This page was built for publication: A strengthening of Ben Rebea's lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321993)
