Blockers and transversals

This publication has 10 references indexed in Scilit:

• On complexity of special maximum matchings constructing
  Discrete Mathematics, 2008
• Bicolored Matchings in Some Classes of Graphs
  Graphs and Combinatorics, 2007
• NP-completeness results for edge modification problems
  Discrete Applied Mathematics, 2006
• Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
  Journal of Graph Theory, 2006
• Complexity classification of some edge modification problems
  Discrete Applied Mathematics, 2001
• Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
  SIAM Journal on Computing, 2001
• Node-Deletion Problems on Bipartite Graphs
  SIAM Journal on Computing, 1981
• Edge-Deletion Problems
  SIAM Journal on Computing, 1981
• The node-deletion problem for hereditary properties is NP-complete
  Journal of Computer and System Sciences, 1980
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965