Induced matchings in intersection graphs
From MaRDI portal
Recommendations
Cited in
(14)- Maximum induced matchings for chordal graphs in linear time
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in intersection graphs.
- Finding a maximum induced matching in weakly chordal graphs
- The conditions of a matching being induced
- Matching critical intersection hypergraphs
- Induced Matching in Some Subclasses of Bipartite Graphs
- On intersection graphs of 2-matchings in cubic graphs
- Squares of Intersection Graphs and Induced Matchings
- Induced matchings in subcubic graphs without short cycles
- Improved induced matchings in sparse graphs
- Complexity of deciding the equality of matching numbers
- The algebraic connectivity of graphs with given induced matching number
- Induced matchings in bipartite graphs
This page was built for publication: Induced matchings in intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816065)