scientific article; zbMATH DE number 5717196
From MaRDI portal
Publication:3565868
Recommendations
- scientific article; zbMATH DE number 4086467
- On two extensions of equimatchable graphs
- scientific article; zbMATH DE number 3873377
- scientific article; zbMATH DE number 1808637
- Totally equimatchable graphs
- On two equimatchable graph classes
- scientific article; zbMATH DE number 6605082
- Equimatchable regular graphs
- On three extensions of equimatchable graphs
- Edge-stable equimatchable graphs
Cited in
(25)- Totally equimatchable graphs
- Equimatchable claw-free graphs
- Global forcing number for maximal matchings
- Note on extremal graphs with given matching number
- On two extensions of equimatchable graphs
- On two equimatchable graph classes
- Equimatchable bipartite graphs
- Efficient recognition of equimatchable graphs
- On well-edge-dominated graphs
- A note on the graphs with given small matching number.
- scientific article; zbMATH DE number 3873377 (Why is no real title available?)
- Equimatchable Graphs on Surfaces
- scientific article; zbMATH DE number 1472393 (Why is no real title available?)
- Equimatchable regular graphs
- Edge-Critical Equimatchable Bipartite Graphs
- Maximal matchings in polyspiro and benzenoid chains
- On three extensions of equimatchable graphs
- Block allocation of a sequential resource
- scientific article; zbMATH DE number 6605082 (Why is no real title available?)
- Triangle‐free equimatchable graphs
- MANIFOLD MATCHING COMPLEXES
- Gorenstein and Cohen–Macaulay matching complexes
- On well (edge) dominated and equimatchable strong product graphs
- Common matching number of a graph
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565868)
