Single-source three-disjoint path covers in cubes of connected graphs (Q2444763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single-source three-disjoint path covers in cubes of connected graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Single-source three-disjoint path covers in cubes of connected graphs |
scientific article |
Statements
Single-source three-disjoint path covers in cubes of connected graphs (English)
0 references
11 April 2014
0 references
disjoint path cover
0 references
Hamiltonicity
0 references
graph embedding
0 references
cube of a graph
0 references
combinatorial problems
0 references
