Pages that link to "Item:Q995582"
From MaRDI portal
The following pages link to The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582):
Displaying 8 items.
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Maximum induced matching problem on hhd-free graphs (Q765362) (← links)
- A min-max property of chordal bipartite graphs with applications (Q1959718) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- On Maximal Chain Subgraphs and Covers of Bipartite Graphs (Q2819498) (← links)
- Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
