# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a007031
Showing 1-1 of 1

%I A007031 M4278 #16 Aug 07 2021 17:21:42
%S A007031 0,0,0,0,0,0,0,0,0,0,0,0,1,6,72,847,9801
%N A007031 Non-Hamiltonian 1-tough simplicial polyhedra with n nodes.
%C A007031 A graph is 1-tough if there is no set of k vertices whose deletion splits the graph into more than k components. - _Hugo Pfoertner_ citing _William P. Orrick_ in A342971, Aug 04 2021
%D A007031 M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.
%D A007031 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A007031 M. B. Dillencourt, <a href="https://doi.org/10.1006/jctb.1996.0008">Polyhedra of small orders and their Hamiltonian properties</a>, J. Comb. Theory, Ser. B, 66 (1996) 87-122.
%Y A007031 Cf. A007030.
%K A007031 nonn,hard,more
%O A007031 1,14
%A A007031 _N. J. A. Sloane_.

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE