On paths avoding forbidden pairs of vertices in a graph (Q678872): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710423558064 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum number of disjoint paths connecting specified terminals in a graph / rank | |||
Normal rank | |||
Latest revision as of 12:21, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On paths avoding forbidden pairs of vertices in a graph |
scientific article |
Statements
On paths avoding forbidden pairs of vertices in a graph (English)
0 references
14 December 1997
0 references
forbidden pairs
0 references
software testing
0 references
validation
0 references
\(F\)-cut
0 references
