Squares of Intersection Graphs and Induced Matchings
From MaRDI portal
Recommendations
Cites work
- A New Algorithm for Generating All the Maximal Independent Sets
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Bipartite graphs without a skew star
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- scientific article; zbMATH DE number 434499 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- Induced matchings
- Irredundancy in circular arc graphs
- New results on induced matchings
- NP-completeness of some generalizations of the maximum matching problem
- On graphs with polynomially solvable maximum-weight clique problem
- On maximal independent sets of vertices in claw-free graphs
- On maximum induced matchings in bipartite graphs
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Some results on graphs without long induced paths
Cited in
(4)
This page was built for publication: Squares of Intersection Graphs and Induced Matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439440)