Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Görlich, Agieszka"'
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-bipartite, and the tuple $(|E|, \Delta_U, \Delta_V)$, where $\Delta_U$ a
Externí odkaz:
http://arxiv.org/abs/2307.07315
