Maximally non-hamiltonian graphs of girth 7 (Q2563426): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a construction of Thomassen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hypohamiltonian and hypotraceable graphs / rank | |||
Normal rank | |||
Latest revision as of 15:16, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximally non-hamiltonian graphs of girth 7 |
scientific article |
Statements
Maximally non-hamiltonian graphs of girth 7 (English)
0 references
20 July 1997
0 references
A graph is maximally non-hamiltonian (MNH) if it is non-hamiltonian but any two non-adjacent vertices are connected by a hamiltonian path. A well-known construction of \textit{C. Thomassen} for hypo-hamiltonian graphs [Discrete Math. 9, 91-96 (1974; Zbl 0272.05114)] is shown to produce an infinite number of MNH graphs of girth 7 when iteratively applied to the Coxeter graph (which was the only previously known MNH graph of girth 7).
0 references
maximally non-hamiltonian
0 references
hamiltonian path
0 references
girth
0 references
