Connected matchings in chordal bipartite graphs
From MaRDI portal
Publication:2339830
Recommendations
Cites work
- scientific article; zbMATH DE number 1953189 (Why is no real title available?)
- A notion of cross-perfect bipartite graphs
- Algorithmic graph theory and perfect graphs
- Alternating cycle-free matchings
- Approximating the maximum clique minor and some subgraph homeomorphism problems
- Finding Large Clique Minors is Hard
- Maximum induced matchings for chordal graphs in linear time
- Node-Deletion Problems on Bipartite Graphs
- On a special case of Hadwiger's conjecture
- On the complexity of approximating the Hadwiger number
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles
Cited in
(7)- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- scientific article; zbMATH DE number 1953189 (Why is no real title available?)
- Disconnected matchings
- Disconnected matchings
- Multitasking capacity: hardness results and improved constructions
- Polyhedral approach to weighted connected matchings in general graphs
This page was built for publication: Connected matchings in chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339830)