# Classification of maximally non-hamiltonian graphs?

A graph is called maximally non-hamiltonian, if it does not contain a hamilton-cycle, but no edge can be added without creating a hamilton-cycle. In other words, every pair of non-adjacent vertices $(u/v)$ can be connected with a hamiltonian path.

• How can the maximally non-hamiltonian graphs be classified with known graph properties ?
• OEIS states that the number of maximally non-hamiltonian graphs with $1,2,3,4,5,6,7,8,9,10$ vertices is $0,1,1,1,3,3,7,9,18,31$. Can someone enumerate these graphs and list those with maximum degree $<n-1$, if n is the number of vertices ? – Peter Oct 14 '14 at 11:27

Using the edge count. If there is a non-Hamiltonian graph $G$ on $n$ vertices, the maximal number of edges that $G$ can contain is ${n-1\choose 2} +1 = {n\choose 2} - (n-2).$
• This is confusing. The maximum number of edges in a graph with $n$ vertices is $\binom{n}{2}$. Perhaps you are trying to argue something about edges of a special kind of graph, like discussed in the Question. But your one-line answer fails to make such a connection clear. – hardmath Feb 20 '16 at 18:23
• So are you saying that maximally non-hamiltonian graphs can be classified by counting the number of edges? Does this tell us how many (up to isomorphism) maximally non-hamiltonian graphs on $5$ vertices there are? – hardmath Feb 20 '16 at 19:06
• There is a unique Extremal graph with the number of edges I listed on $n$ vertices so that there is no Hamilton cycle. Many graphs with fewer edges are not Hamiltonian, but they will not be maximally so. – Henry Mar 3 '16 at 20:52
• If your claim that the extremal graph was unique were true, then counting edges would work to classify them (as would counting the vertices). But the OP has referenced OEIS sequence A185306, according to which there are three distinct maximally non-Hamiltonian graphs on $5$ vertices. – hardmath Mar 3 '16 at 22:28
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.25884029269218445, "perplexity": 280.5015479804428}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2019-30/segments/1563195530250.98/warc/CC-MAIN-20190724020454-20190724042454-00215.warc.gz"}