A note on the problem of finding a (3,9)-cage (Q1068846)

From MaRDI portal
Revision as of 09:41, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A note on the problem of finding a (3,9)-cage
scientific article

    Statements

    A note on the problem of finding a (3,9)-cage (English)
    0 references
    1985
    0 references
    We discuss the problem of finding a (3,9)-cage. A Hamiltonian graph with girth 9 and 54 vertices is given. Except four vertices, each of the remaining vertices of this graph has valency three. This graph is obtained with the aid of a computer.
    0 references
    0 references
    regular graph
    0 references
    (3,9)-cage
    0 references
    Hamiltonian graph
    0 references
    0 references
    0 references