Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5514188 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Über die Maximalzahl kreuzungsfreier H-Wege / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4739657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4144192 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:45, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum number of disjoint paths connecting specified terminals in a graph |
scientific article |
Statements
Maximum number of disjoint paths connecting specified terminals in a graph (English)
0 references
5 July 1995
0 references
matching problem
0 references
odd \(T\)-disconnector
0 references