Searching Arxiv, refresh for possibly better results.

total 1took 0.01s

Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular CaseJul 10 2019Given a family $\mathcal{H}$ of graphs and a positive integer $k$, a graph $G$ is called vertex $k$-fault-tolerant with respect to $\mathcal{H}$, denoted by $k$-FT$(\mathcal{H})$, if $G-S$ contains some $H\in\mathcal{H}$ as a subgraph, for every $S\subset ... More