Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem (Q2898470)
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: Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem |
scientific article; zbMATH DE number 6054488
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem |
scientific article; zbMATH DE number 6054488 |
Statements
11 July 2012
0 references
Hamiltonian circuit problem
0 references
directed line graphs
0 references
quasi-adjoint graphs
0 references
graph reduction
0 references
digraphs
0 references
Reduced-by-matching graphs: toward simplifying Hamiltonian circuit problem (English)
0 references
