The following pages link to (Q3340896):
Displaying 33 items.
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Weighted well-covered claw-free graphs (Q482209) (← links)
- On minimum maximal distance-\(k\) matchings (Q509288) (← links)
- On three extensions of equimatchable graphs (Q510986) (← links)
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) (Q738850) (← links)
- Greedily constructing maximal partial \(f\)-factors (Q1025473) (← links)
- Bounding the size of equimatchable graphs of fixed genus (Q1043800) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- The uniformity space of hypergraphs and its applications (Q1301700) (← links)
- Well-covered graphs and extendability (Q1318795) (← links)
- The structure of well-covered graphs and the complexity of their recognition problems (Q1354731) (← links)
- Equimatchable claw-free graphs (Q1660273) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On two extensions of equimatchable graphs (Q1751251) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- On the depth of combinatorial optimization problems (Q1801676) (← links)
- On two equimatchable graph classes (Q1810651) (← links)
- On 4-connected claw-free well-covered graphs (Q1917239) (← links)
- Independence number in \(n\)-extendable graphs (Q1918549) (← links)
- Equimatchable bipartite graphs (Q2107742) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- Efficient recognition of equimatchable graphs (Q2350604) (← links)
- Edge-stable equimatchable graphs (Q2414461) (← links)
- A short update on equipackable graphs (Q2467992) (← links)
- On well-edge-dominated graphs (Q2673496) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- Equimatchable Regular Graphs (Q4604013) (← links)
- Edge-Critical Equimatchable Bipartite Graphs (Q5014683) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- (Q5149984) (← links)
- Triangle‐free equimatchable graphs (Q6057652) (← links)
- Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
- Graphs with each edge in at most one maximum matching (Q6130212) (← links)
