Maximum induced matching of hexagonal graphs
DOI10.1007/S40840-015-0288-9zbMATH Open1339.05307OpenAlexW2222374963MaRDI QIDQ726519FDOQ726519
Authors: Rija Erveš, Petra Šparl 
Publication date: 11 July 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-015-0288-9
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
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Paths, Trees, and Flowers
- On the \(k\)-path vertex cover of some graph products
- Minimum \(k\)-path vertex cover
- Induced matchings
- NP-completeness of some generalizations of the maximum matching problem
- The strong chromatic index ofC4-free graphs
- Title not available (Why is that?)
- On the approximability of the maximum induced matching problem
- New results on induced matchings
- On the induced matching problem
- Simpler multicoloring of triangle-free hexagonal graphs
- Approximation and Online Algorithms
- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
- Irredundancy in circular arc graphs
- Title not available (Why is that?)
- 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
- Multicoloring of cannonball graphs
- Maximum induced matching problem on hhd-free graphs
Cited In (7)
- 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
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
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)
