Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem (Q2898470): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q115198425, #quickstatements; #temporary_batch_1708039061803 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem |
scientific article |
Statements
Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem (English)
0 references
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
