EntityQ3115577· pop 7· linked from 17 articleshypohamiltonian graphSign in to savegraph 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 HamiltonianConnectionsHamiltonian pathEntitymathematicsEntityInternational Standard Book NumberEntitydigital object identifierEntityDonald KnuthEntitygraph theoryEntityparityEntitygraphEntityJSTOROrganizationbibcodeEntityQ118398Entitynetwork topologyEntitymodular arithmeticEntityparallel computingEntityconjectureEntitytravelling salesperson problemEntityOn-Line Encyclopedia of Integer SequencesEntityexponential growthEntitycomputational complexity theoryEntityMathWorldEntityCategoriesGraph familiesHamiltonian paths and cycles