(Q3115577)

English

hypohamiltonian graph

graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit