Minimum $k$-critical-bipartite graphs: the irregular Case

Sylwia Cichacz, Agieszka Görlich, Karol Suchan

We study the problem of finding a minimum $k$-critical-bipartite graph of order $(n,m)$: a bipartite graph $G=(U,V;E)$, with $|U|=n$, $|V|=m$, and $n>m>1$, which is $k$-critical-bi…