Randomly matchable graphs
From MaRDI portal
Cited in
(43)- Global forcing number for maximal matchings
- Graphs with each edge in at most one maximum matching
- scientific article; zbMATH DE number 4145958 (Why is no real title available?)
- The hardness of the independence and matching clutter of a graph
- Efficient recognition of equimatchable graphs
- scientific article; zbMATH DE number 90530 (Why is no real title available?)
- On two equimatchable graph classes
- When should you wait before updating? -- Toward a robustness refinement
- Spectral conditions for matching extension
- Hardness and approximation of minimum maximal matchings
- The cost of perfection for matchings in graphs
- Triangle‐free equimatchable graphs
- On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching
- On regular-stable graphs
- Totally equimatchable graphs
- Random packings of graphs
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- A short update on equipackable graphs
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
- Edge-Critical Equimatchable Bipartite Graphs
- Bounding the size of equimatchable graphs of fixed genus
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- Equimatchable claw-free graphs
- scientific article; zbMATH DE number 4068925 (Why is no real title available?)
- Equistable simplicial, very well-covered, and line graphs
- Vertex-transitive CIS graphs
- scientific article; zbMATH DE number 4164912 (Why is no real title available?)
- Equimatchable bipartite graphs
- Global forcing number for maximal matchings in corona products
- Spectral conditions for k-extendability and k-factors of bipartite graphs
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
- On 4-connected claw-free well-covered graphs
- On well-edge-dominated graphs
- Equimatchable regular graphs
- On well (edge) dominated and equimatchable strong product graphs
- Removable and forced subgraphs of graphs
- Greedily constructing maximal partial f-factors
- Randomly H-coverable graphs
- Equimatchable Graphs on Surfaces
- Critical equimatchable graphs
- Common matching number of a graph
- Randomly planar graphs
- Edge-stable equimatchable graphs
This page was built for publication: Randomly matchable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189320)