Toughness and nonhamiltonicity of polyhedral graphs (Q2366022): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127957376, #quickstatements; #temporary_batch_1722243545156 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A 1-tough nonhamiltonian maximal planar graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound on the shortness exponent of 1-tough, maximal planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortness exponents of families of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5575344 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4775880 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127957376 / rank | |||
Normal rank | |||
Latest revision as of 10:06, 29 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toughness and nonhamiltonicity of polyhedral graphs |
scientific article |
Statements
Toughness and nonhamiltonicity of polyhedral graphs (English)
0 references
29 June 1993
0 references
toughness
0 references
nonhamiltonian polyhedral graph
0 references
shortness exponent
0 references
