Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid
Authors:
- B. RiesBRB. Ries
- C. BentzCBC. Bentz
- C. PicouleauCPC. Picouleau
- D. de WerraDWD. de Werra
- M.-C. CostaMCM.-C. Costa
- R. ZenklusenRZR. Zenklusen
- 1 January 2010
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 310 (1) , 132-146
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Graphes2010
- Additive approximation for edge-deletion problemsAnnals of Mathematics, 2009
- Blockers and transversalsDiscrete Mathematics, 2009
- NP-completeness results for edge modification problemsDiscrete Applied Mathematics, 2006
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithmsJournal of Graph Theory, 2006
- Complexity classification of some edge modification problemsDiscrete Applied Mathematics, 2001
- Edge-Deletion ProblemsSIAM Journal on Computing, 1981