Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem (Q2898470): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.3233/fi-2012-711 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1498196328 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 30 July 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
