\(L(n)\) graphs are vertex-pancyclic and Hamilton-connected (Q2089930)

From MaRDI portal
scientific article
Language Label Description Also known as
English
\(L(n)\) graphs are vertex-pancyclic and Hamilton-connected
scientific article

    Statements

    \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected (English)
    0 references
    0 references
    24 October 2022
    0 references
    \(L(n)\) graph
    0 references
    path
    0 references
    cycle
    0 references
    vertex-pancyclic graph
    0 references
    Hamilton-connected graph
    0 references

    Identifiers