General-demand disjoint path covers in a graph with faulty elements (Q4903561)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6127898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General-demand disjoint path covers in a graph with faulty elements |
scientific article; zbMATH DE number 6127898 |
Statements
General-demand disjoint path covers in a graph with faulty elements (English)
0 references
22 January 2013
0 references
disjoint paths
0 references
Menger's theorem
0 references
Fan lemma
0 references
hypercube-like graphs
0 references
proper interval graphs
0 references
0.8282067775726318
0 references
0.8238427042961121
0 references
0.8155074715614319
0 references
0.8080002069473267
0 references
0.7992836833000183
0 references
