On efficient domination for some classes of H-free bipartite graphs.

Andreas Brandstädt Raffaele Mosca

Published in: Discret. Appl. Math. (2019)

Keyphrases

bipartite graph
maximum matching
decision trees
pairwise
link prediction
graph model
maximum cardinality