3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (Q742625)

From MaRDI portal
scientific article
Language Label Description Also known as
English
3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
scientific article

    Statements

    3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 September 2014
    0 references
    Hamilton-connected
    0 references
    3-connected
    0 references
    claw-free
    0 references
    dominating
    0 references
    closure
    0 references

    Identifiers