QR-koda

A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs

Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2 ≥ . . . ≥ cn. We say that L = (L1; L2) is pot...

Olles dieđut

Furkejuvvon:
Bibliográfalaš dieđut
Váldodahkkit: Guo Ji-Yun, Yin Jian-Hua
Materiálatiipa: Artigo
Giella:Inglês
Almmustuhtton: University of Zielona Góra 2017-02-01
Ráidu:Discussiones Mathematicae Graph Theory
Fáttát:
Liŋkkat:https://doi.org/10.7151/dmgt.1928
Fáddágilkorat: Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!