The following pages link to Equimatchable claw-free graphs (Q1660273):
Displaying 6 items.
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Efficient recognition of equimatchable graphs (Q2350604) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- Claw-free graphs with equal 2-domination and domination numbers (Q5279559) (← links)
- Triangle‐free equimatchable graphs (Q6057652) (← links)
- Graphs with each edge in at most one maximum matching (Q6130212) (← links)