Hypohamiltonian graphs and their crossing number (Q1953317)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Hypohamiltonian graphs and their crossing number
scientific article

    Statements

    Hypohamiltonian graphs and their crossing number (English)
    0 references
    7 June 2013
    0 references
    Summary: We prove that for every \(k \geq 0\) there is an integer \(n_0(k)\) such that, for every \(n \geq n_0\), there exists a hypohamiltonian graph which has order \(n\) and crossing number \(k\).
    0 references
    hypohamiltonian graphs
    0 references
    crossing number
    0 references

    Identifiers