scientific article; zbMATH DE number 434691

From MaRDI portal
Publication:3139528





A graph \(G\) is called \(k\)-path pairable if for any \(k\) pairs of distinct vertices there are \(k\) vertex disjoint paths connecting them. Denote by \(p_ k(n,\Delta)\) the minimum number of edges in a \(k\)-path pairable graph of maximum degree \(\Delta\) and order \(n\). The paper gives the values of \(p_ 2(n,\Delta)\) and \(p_ 3(n,\Delta)\) for \(\Delta \geq 9\). For the entire collection see [Zbl 0772.00026].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139528)