scientific article; zbMATH DE number 5717196
From MaRDI portal
Publication:3565868
zbMATH Open1196.05076MaRDI QIDQ3565868FDOQ3565868
Authors: Allan Frendrup, Preben Dahl Vestergaard, Bert L. Hartnell 
Publication date: 7 June 2010
Title of this publication is not available (Why is that?)
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (22)
- Title not available (Why is that?)
- Efficient recognition of equimatchable graphs
- On two extensions of equimatchable graphs
- On two equimatchable graph classes
- Triangle‐free equimatchable graphs
- Maximal matchings in polyspiro and benzenoid chains
- Note on extremal graphs with given matching number
- Gorenstein and Cohen–Macaulay matching complexes
- A note on the graphs with given small matching number.
- Edge-Critical Equimatchable Bipartite Graphs
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
- Equimatchable claw-free graphs
- Title not available (Why is that?)
- Equimatchable bipartite graphs
- On well-edge-dominated graphs
- Equimatchable regular graphs
- Title not available (Why is that?)
- Equimatchable Graphs on Surfaces
- On three extensions of equimatchable graphs
- Block allocation of a sequential resource
- MANIFOLD MATCHING COMPLEXES
- Global forcing number for maximal matchings
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)
