An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs (Q6478110)
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: An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs |
scientific article; zbMATH DE number 900080529
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective algorithm for the enumeration of edge colorings and Hamiltonian cycles in cubic graphs |
scientific article; zbMATH DE number 900080529 |
Statements
26 October 2006
0 references
math.CO
0 references
