The induced matching and chain subgraph cover problems for convex bipartite graphs
From MaRDI portal
Publication:995582
DOI10.1016/J.TCS.2007.04.006zbMATH Open1188.68209OpenAlexW1974918981MaRDI QIDQ995582FDOQ995582
Authors: Andreas Brandstädt, Elaine M. Eschen, R. Sritharan 
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.04.006
Recommendations
- Induced Matching in Some Subclasses of Bipartite Graphs
- Maximum weight induced matching in some subclasses of bipartite graphs
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- A min-max property of chordal bipartite graphs with applications
- Finding maximum edge bicliques in convex bipartite graphs
Cites Work
- Graph Classes: A Survey
- Induced matchings
- On maximum induced matchings in bipartite graphs
- Node-Deletion Problems on Bipartite Graphs
- On the 2-Chain Subgraph Cover and Related Problems
- Induced matchings in asteroidal triple-free graphs
- Threshold Dimension of Graphs
- New results on induced matchings
- Induced matchings in intersection graphs.
- Finding a maximum induced matching in weakly chordal graphs
- Optimizing weakly triangulated graphs
- Title not available (Why is that?)
- Irredundancy in circular arc graphs
- On the complexity of the k-chain subgraph cover problem
- Title not available (Why is that?)
Cited In (12)
- Induced Matching in Some Subclasses of Bipartite Graphs
- Induced matchings in graphs of degree at most 4
- Maximum induced matching problem on hhd-free graphs
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs
- A min-max property of chordal bipartite graphs with applications
- Graphs with maximal induced matchings of the same size
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Dominating induced matchings
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
- Well-indumatched pseudoforests
- Recent progress on strong edge-coloring of graphs
- On maximal chain subgraphs and covers of bipartite graphs
This page was built for publication: The induced matching and chain subgraph cover problems for convex bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995582)
