A large set of non-Hamiltonian graphs (Q5954242): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Not every 2-tough graph is Hamiltonian / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recognizing tough graphs is NP-hard / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Better approximations of non-Hamiltonian graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Toughness and edge-toughness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of facets (and some facets of complexity) / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(01)00219-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042599036 / rank | |||
Normal rank | |||
Latest revision as of 12:08, 30 July 2024
scientific article; zbMATH DE number 1699131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A large set of non-Hamiltonian graphs |
scientific article; zbMATH DE number 1699131 |
Statements
A large set of non-Hamiltonian graphs (English)
0 references
22 July 2002
0 references
edge-toughness
0 references
Hamiltonian cycle
0 references
