Two new sufficient conditions for Hamilton-connected graphs (Q1898892)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Two new sufficient conditions for Hamilton-connected graphs
scientific article

    Statements

    Two new sufficient conditions for Hamilton-connected graphs (English)
    0 references
    25 September 1995
    0 references
    The author gives two sufficient conditions for a 3-connected graph to be Hamilton-connected. The conditions are best possible and independent (one does not imply the other).
    0 references
    Hamilton-connected graphs
    0 references
    Hamiltonian graph
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references