A planar hypohamiltonian graph with 48 vertices (Q3594955): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56001743, #quickstatements; #temporary_batch_1710982311091 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Planar cubic hypohamiltonian and hypotraceable graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A two-connected planar graph without concurrent longest paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On longest paths and circuits in graphs. / rank | |||
Normal rank | |||
Revision as of 12:17, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A planar hypohamiltonian graph with 48 vertices |
scientific article |
Statements
A planar hypohamiltonian graph with 48 vertices (English)
0 references
9 August 2007
0 references
planar
0 references
hypohamiltonian
0 references
hypotraceable
0 references
graph
0 references
