Directed circuits on a torus (Q1180428): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The directed subgraph homeomorphism problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. VI. Disjoint paths across a disc / rank | |||
Normal rank | |||
Revision as of 13:01, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Directed circuits on a torus |
scientific article |
Statements
Directed circuits on a torus (English)
0 references
27 June 1992
0 references
The author gives a polynomial algorithm for deciding if any two vertices of a digraph lie in a directed circuit. In addition, a polynomial algorithm is given for deciding the presence of a collection of disjoint directed circuits of prescribed homotopy in a digraph drawn on a torus.
0 references
digraph
0 references
circuits
0 references
