Maximum number of disjoint paths connecting specified terminals in a graph

DOI10.1016/0166-218X(94)90007-8zbMath0815.68075MaRDI QIDQ1339394

Hananya Yinnone

Publication date: 5 July 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matching problemodd \(T\)-disconnector

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (2)

On paths avoding forbidden pairs of vertices in a graph ⋮ Length-constrained path-matchings in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über die Maximalzahl kreuzungsfreier H-Wege
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen

This page was built for publication: Maximum number of disjoint paths connecting specified terminals in a graph