No label defined (Q3139528)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 434691
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 434691

      Statements

      0 references
      0 references
      0 references
      22 June 1994
      0 references
      path pairable graphs
      0 references
      maximum degree
      0 references
      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].
      0 references

      Identifiers