Maximum number of disjoint paths connecting specified terminals in a graph
type: Item
instance of: scholarly article
title: Maximum number of disjoint paths connecting specified terminals in a graph
zbMATH Open document ID: 0815.68075
DOI: 10.1016/0166-218X(94)90007-8
author: Hananya Yinnone
published in: Discrete Applied Mathematics
publication date: 1995-07-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 699141
zbMATH Keywords: matching problem
zbMATH Keywords: odd \(T\)-disconnector
MaRDI profile type: Publication
cites work: Paths, Trees, and Flowers
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q5514188
cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
cites work: Q3048571
cites work: Über die Maximalzahl kreuzungsfreier H-Wege
cites work: Q4739657
cites work: Q4144192
description: scientific article; zbMATH DE number 699141