scientific article; zbMATH DE number 3873377
From MaRDI portal
Publication:3340896
Recommendations
- scientific article; zbMATH DE number 5532149
- scientific article; zbMATH DE number 6605082
- Totally equimatchable graphs
- scientific article; zbMATH DE number 1279034
- Equimatchable regular graphs
- Equimatchable bipartite graphs
- Equistable graphs
- scientific article; zbMATH DE number 5717196
- Edge-stable equimatchable graphs
- Matching equivalencies of bipartite graphs
Cited in
(42)- Partitions and well-coveredness: the graph sandwich problem
- On the depth of combinatorial optimization problems
- Triangle‐free equimatchable graphs
- scientific article; zbMATH DE number 6605082 (Why is no real title available?)
- Edge-Critical Equimatchable Bipartite Graphs
- Equimatchable claw-free graphs
- Well-indumatched Trees and Graphs of Bounded Girth
- Independence number in \(n\)-extendable graphs
- Equimatchable regular graphs
- On 4-connected claw-free well-covered graphs
- Matched drawability of graph pairs and of graph triples
- Edge-stable equimatchable graphs
- On two equimatchable graph classes
- Well-covered graphs and extendability
- Graphs vertex-partitionable into strong cliques
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
- scientific article; zbMATH DE number 5717196 (Why is no real title available?)
- Critical equimatchable graphs
- Bounding the size of equimatchable graphs of fixed genus
- On well-edge-dominated graphs
- scientific article; zbMATH DE number 1472393 (Why is no real title available?)
- The uniformity space of hypergraphs and its applications
- On the (parameterized) complexity of recognizing well-covered \((r,\ell)\)-graphs
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- The structure of well-covered graphs and the complexity of their recognition problems
- scientific article; zbMATH DE number 7308162 (Why is no real title available?)
- Matching theory -- a sampler: From Dénes König to the present
- Equivalence classes in matching covered graphs
- A short update on equipackable graphs
- Polynomial time recognition of essential graphs having stability number equal to matching number
- Weighted well-covered claw-free graphs
- Graphs with each edge in at most one maximum matching
- On minimum maximal distance-\(k\) matchings
- Greedily constructing maximal partial \(f\)-factors
- On three extensions of equimatchable graphs
- scientific article; zbMATH DE number 5532149 (Why is no real title available?)
- On two extensions of equimatchable graphs
- Efficient recognition of equimatchable graphs
- Equimatchable bipartite graphs
- Graphs with maximal induced matchings of the same size
- Equimatchable Graphs on Surfaces
- Recognizing well-dominated graphs is coNP-complete
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 Q3340896)
