Maximum induced matching problem on hhd-free graphs
From MaRDI portal
Publication:765362
DOI10.1016/J.DAM.2011.08.027zbMATH Open1237.05166OpenAlexW2019670386MaRDI QIDQ765362FDOQ765362
R. Sritharan, Chandra Mohan Krishnamurthy
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.027
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Induced matchings
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Induced matchings in asteroidal triple-free graphs
- NP-completeness of some generalizations of the maximum matching problem
- Four classes of perfectly orderable graphs
- New results on induced matchings
- Maximum induced matchings for chordal graphs in linear time
- Induced matchings in intersection graphs.
- Finding a maximum induced matching in weakly chordal graphs
- Title not available (Why is that?)
- On distance-3 matchings and induced matchings
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- On the semi-perfect elimination
- A min-max property of chordal bipartite graphs with applications
- LexBFS-orderings and powers of chordal graphs
- Irredundancy in circular arc graphs
- On brittle graphs
- Title not available (Why is that?)
- Duchet-type theorems for powers of HHD-free graphs
Cited In (3)
Recommendations
- Maximum induced matchings in graphs 👍 👎
- Maximal induced matchings in triangle-free graphs 👍 👎
- Maximal induced matchings in triangle-free graphs 👍 👎
- Induced matchings in graphs of bounded maximum degree 👍 👎
- On maximum induced matchings in bipartite graphs 👍 👎
- On the approximability of the maximum induced matching problem 👍 👎
- On the induced matching problem in Hamiltonian bipartite graphs 👍 👎
- Graphs with maximal induced matchings of the same size 👍 👎
- Maximum induced matchings for chordal graphs in linear time 👍 👎
- Maximum induced matchings close to maximum matchings 👍 👎
This page was built for publication: Maximum induced matching problem on hhd-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765362)
