Highly-connected planar cubic graphs with few or many Hamilton cycles (Q2329193): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q412174 |
Created claim: Wikidata QID (P12): Q127402667, #quickstatements; #temporary_batch_1723710233280 |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Gordon F. Royle / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: plantri / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: GenerateUHG / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2966470250 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1901.10683 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3548359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4909702 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Infinitely many planar cubic hypohamiltonian graphs of girth 5 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of Hamiltonian cycles in certain generalized Petersen graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Hamiltonian Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048871 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127402667 / rank | |||
Normal rank |
Latest revision as of 09:39, 15 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Highly-connected planar cubic graphs with few or many Hamilton cycles |
scientific article |
Statements
Highly-connected planar cubic graphs with few or many Hamilton cycles (English)
0 references
17 October 2019
0 references
cubic graph
0 references
planar graph
0 references
Hamilton cycle
0 references
cyclic edge-connectivity
0 references
fullerene
0 references
nanotube
0 references