scientific article; zbMATH DE number 1286752

MaRDI QIDQ4243059zbMATH OpenFDO

Authors Ralph Faudree, András Gyárfás, Jeno Lehel

Publication date 24 September 1999

zbMATH Keywords

edge-disjoint pathsmaximum degree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 434691
• On the maximum degree of path-pairable planar graphs
• Note on the diameter of path-pairable graphs
• On path-pairability of the finite grids

Cited in

(16)

• The minimum size of graphs satisfying cut conditions
• On the maximum diameter of path-pairable graphs
• The path-pairability number of product of stars
• 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
• Minimal 2-connected graphs satisfying the even cut condition
• The terminal-pairability problem in complete bipartite graphs
• scientific article; zbMATH DE number 434691 (Why is no real title available?)
• Note on the diameter of path-pairable graphs
• scientific article; zbMATH DE number 1842917 (Why is no real title available?)
• Note on terminal-pairability in complete grid graphs
• Partitions of the edge set of a graph into internally disjoint paths
• Algorithms and Computation
• An improved upper bound on the maximum degree of terminal-pairable complete graphs
• On path-pairability in the Cartesian product of graphs
• Path extendable graphs

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 Q4243059)