A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490)
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: A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph |
scientific article; zbMATH DE number 6668740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph |
scientific article; zbMATH DE number 6668740 |
Statements
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (English)
0 references
28 December 2016
0 references
disjoint path cover
0 references
cube of graph
0 references
Hamiltonian path
0 references
spanning tree
0 references
unicyclic graph
0 references
linear-time algorithm
0 references
0 references
