Maximum induced matching of hexagonal graphs
From MaRDI portal
Recommendations
- Induced matchings
- Induced Matching in Some Subclasses of Bipartite Graphs
- On maximum induced matchings in bipartite graphs
- 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
- New results on induced matchings
Cites work
- scientific article; zbMATH DE number 434499 (Why is no real title available?)
- scientific article; zbMATH DE number 1420901 (Why is no real title available?)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
- Approximation and Online Algorithms
- Induced matchings
- Irredundancy in circular arc graphs
- Maximum induced matching problem on hhd-free graphs
- Minimum \(k\)-path vertex cover
- Multicoloring of cannonball graphs
- NP-completeness of some generalizations of the maximum matching problem
- New results on induced matchings
- On the k-path vertex cover of some graph products
- On the approximability of the maximum induced matching problem
- On the induced matching problem
- Paths, Trees, and Flowers
- Simpler multicoloring of triangle-free hexagonal graphs
- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
- The strong chromatic index ofC4-free graphs
Cited in
(7)- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
- 3-path vertex cover and dissociation number of hexagonal graphs
- Induced matchings
- On maximum induced matching numbers of special grids
- Maximum Induced Matchings in Grids
- A note on the NP-hardness of two matching problems in induced subgrids
- 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
This page was built for publication: Maximum induced matching of hexagonal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726519)
