scientific article
From MaRDI portal
Publication:3340896
zbMath0548.05048MaRDI QIDQ3340896
M. E. Lesk, Michael D. Plummer, William R. Pulleyblank
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The structure of well-covered graphs and the complexity of their recognition problems ⋮ Graphs with maximal induced matchings of the same size ⋮ Equimatchable claw-free graphs ⋮ On 4-connected claw-free well-covered graphs ⋮ Independence number in \(n\)-extendable graphs ⋮ Edge-stable equimatchable graphs ⋮ On well-edge-dominated graphs ⋮ Triangle‐free equimatchable graphs ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs ⋮ Graphs with each edge in at most one maximum matching ⋮ Equimatchable Regular Graphs ⋮ Graphs vertex-partitionable into strong cliques ⋮ Unnamed Item ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Weighted well-covered claw-free graphs ⋮ A short update on equipackable graphs ⋮ On minimum maximal distance-\(k\) matchings ⋮ On three extensions of equimatchable graphs ⋮ On two extensions of equimatchable graphs ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph ⋮ Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\) ⋮ On the depth of combinatorial optimization problems ⋮ On two equimatchable graph classes ⋮ Greedily constructing maximal partial \(f\)-factors ⋮ Bounding the size of equimatchable graphs of fixed genus ⋮ Unnamed Item ⋮ The uniformity space of hypergraphs and its applications ⋮ Edge-Critical Equimatchable Bipartite Graphs ⋮ Equimatchable bipartite graphs ⋮ Efficient recognition of equimatchable graphs ⋮ Well-covered graphs and extendability ⋮ Partitions and well-coveredness: the graph sandwich problem
