The following pages link to (Q3565868):
Displaying 12 items.
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- Global forcing number for maximal matchings (Q1690248) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- Equimatchable bipartite graphs (Q2107742) (← links)
- Efficient recognition of equimatchable graphs (Q2350604) (← links)
- On well-edge-dominated graphs (Q2673496) (← links)
- Equimatchable Regular Graphs (Q4604013) (← links)
- Block allocation of a sequential resource (Q5217060) (← links)
- Triangle‐free equimatchable graphs (Q6057652) (← links)
- MANIFOLD MATCHING COMPLEXES (Q6134984) (← links)
- Gorenstein and Cohen–Macaulay matching complexes (Q6163890) (← links)
