scientific article; zbMATH DE number 1286752

zbMath0921.05043MaRDI QIDQ4243059

Jenő Lehel, András Gyárfás, Ralph J. Faudree

Publication date: 24 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum degreeedge-disjoint paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (11)

Minimal 2-connected graphs satisfying the even cut condition ⋮ The terminal-pairability problem in complete bipartite graphs ⋮ On the maximum degree of path-pairable planar graphs ⋮ Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs ⋮ The minimum size of graphs satisfying cut conditions ⋮ Note on the diameter of path-pairable graphs ⋮ Note on terminal-pairability in complete grid graphs ⋮ An improved upper bound on the maximum degree of terminal-pairable complete graphs ⋮ On path-pairability in the Cartesian product of graphs ⋮ On the maximum diameter of path-pairable graphs ⋮ The path-pairability number of product of stars

This page was built for publication: