Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair (Q5272632): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3124034694 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1705.00479 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Infinite, highly connected digraphs with no two arc-disjoint spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a property of n-edge-connected digraphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:16, 14 July 2024
scientific article; zbMATH DE number 6737924
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair |
scientific article; zbMATH DE number 6737924 |
Statements
Highly Connected Infinite Digraphs Without Edge‐Disjoint Back and Forth Paths Between a Certain Vertex Pair (English)
0 references
30 June 2017
0 references
edge-connectivity
0 references
infinite graph
0 references
self similar
0 references
counterexample
0 references
