A note on orientations of mixed graphs (Q5957358): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Robbins's Theorem for Mixed Multigraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The directed subgraph homeomorphism problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3220319 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On orientations and shortest paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5611649 / rank | |||
Normal rank | |||
Latest revision as of 22:34, 3 June 2024
scientific article; zbMATH DE number 1716750
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on orientations of mixed graphs |
scientific article; zbMATH DE number 1716750 |
Statements
A note on orientations of mixed graphs (English)
0 references
3 July 2002
0 references
The authors study an orientation problem on mixed graphs. The goal is to obtain a directed graph satisfying a certain connectivity requirement. First the authors continue the study of the pair connectivity problem and show that it is NP-complete for mixed graphs. Then they prove several results for two pairs of nodes of mixed graphs.
0 references
orientation
0 references
mixed graphs
0 references
connectivity
0 references
0 references
