scientific article; zbMATH DE number 3873377
From MaRDI portal
Publication:3340896
zbMATH Open0548.05048MaRDI QIDQ3340896FDOQ3340896
Authors: M. E. Lesk, Michael D. Plummer, William R. Pulleyblank 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- scientific article
- 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
- Edge-stable equimatchable graphs
- Matching equivalencies of bipartite graphs
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (41)
- Title not available (Why is that?)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs
- Partitions and well-coveredness: the graph sandwich problem
- Independence number in \(n\)-extendable graphs
- Efficient recognition of equimatchable graphs
- On two extensions of equimatchable graphs
- On two equimatchable graph classes
- Matched drawability of graph pairs and of graph triples
- Triangle‐free equimatchable graphs
- Equimatchable Regular Graphs
- Title not available (Why is that?)
- A short update on equipackable graphs
- Edge-Critical Equimatchable Bipartite Graphs
- Title not available (Why is that?)
- Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
- Matching theory -- a sampler: From Dénes König to the present
- Bounding the size of equimatchable graphs of fixed genus
- Graphs with maximal induced matchings of the same size
- Recognizing well-dominated graphs is coNP-complete
- Equimatchable claw-free graphs
- Well-covered graphs and extendability
- Title not available (Why is that?)
- Equimatchable bipartite graphs
- Weighted well-covered claw-free graphs
- On the depth of combinatorial optimization problems
- On 4-connected claw-free well-covered graphs
- Graphs vertex-partitionable into strong cliques
- On well-edge-dominated graphs
- The uniformity space of hypergraphs and its applications
- The structure of well-covered graphs and the complexity of their recognition problems
- Title not available (Why is that?)
- Greedily constructing maximal partial \(f\)-factors
- Title not available (Why is that?)
- Equivalence classes in matching covered graphs
- Equimatchable Graphs on Surfaces
- On minimum maximal distance-\(k\) matchings
- On three extensions of equimatchable graphs
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
- Well-indumatched Trees and Graphs of Bounded Girth
- Edge-stable equimatchable graphs
- Graphs with each edge in at most one maximum matching
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)
