The complexity of finding a second Hamiltonian cycle in cubic graphs (Q1307702): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcss.1998.1611 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066230947 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4234077 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4027186 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On existence theorems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3959443 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs / rank | |||
Normal rank | |||
Latest revision as of 09:12, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding a second Hamiltonian cycle in cubic graphs |
scientific article |
Statements
The complexity of finding a second Hamiltonian cycle in cubic graphs (English)
0 references
9 November 1999
0 references
cubic graph
0 references
Hamiltonian cycles
0 references
