{"id":"https://openalex.org/W2163178601","doi":"https://doi.org/10.46298/dmtcs.627","title":"Further results on maximal nontraceable graphs of smallest size","display_name":"Further results on maximal nontraceable graphs of smallest size","publication_year":2013,"publication_date":"2013-02-28","ids":{"openalex":"https://openalex.org/W2163178601","doi":"https://doi.org/10.46298/dmtcs.627","mag":"2163178601"},"language":"en","primary_location":{"id":"doi:10.46298/dmtcs.627","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.627","pdf_url":"https://dmtcs.episciences.org/627/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dmtcs.episciences.org/627/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110460350","display_name":"Alewyn P. Burger","orcid":null},"institutions":[{"id":"https://openalex.org/I26092322","display_name":"Stellenbosch University","ror":"https://ror.org/05bk57929","country_code":"ZA","type":"education","lineage":["https://openalex.org/I26092322"]}],"countries":["ZA"],"is_corresponding":true,"raw_author_name":"Alewyn Petrus Burger","raw_affiliation_strings":["Department of Logistics [Stellenbosch]","Department of Logistics [Stellenbosch] (CGW Schumann Building 608 Bosman Street Stellenbosch, 7600. - South Africa)"],"affiliations":[{"raw_affiliation_string":"Department of Logistics [Stellenbosch]","institution_ids":[]},{"raw_affiliation_string":"Department of Logistics [Stellenbosch] (CGW Schumann Building 608 Bosman Street Stellenbosch, 7600. - South Africa)","institution_ids":["https://openalex.org/I26092322"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048266029","display_name":"Joy Singleton","orcid":null},"institutions":[{"id":"https://openalex.org/I165390105","display_name":"University of South Africa","ror":"https://ror.org/048cwvf49","country_code":"ZA","type":"education","lineage":["https://openalex.org/I165390105"]}],"countries":["ZA"],"is_corresponding":false,"raw_author_name":"Joy Elizabeth Singleton","raw_affiliation_strings":["Department of Mathematical Sciences [South Africa]","UNISA - Department of Mathematical Sciences [South Africa] (University of South Africa, P.O. Box 392, UNISA, 0003 South Africa - South Africa)"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences [South Africa]","institution_ids":[]},{"raw_affiliation_string":"UNISA - Department of Mathematical Sciences [South Africa] (University of South Africa, P.O. Box 392, UNISA, 0003 South Africa - South Africa)","institution_ids":["https://openalex.org/I165390105"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110460350"],"corresponding_institution_ids":["https://openalex.org/I26092322"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18381159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Vol. 15 no. 1","issue":"Graph Theory","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8624266982078552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6773124933242798},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5523937344551086},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4462790787220001},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4188392162322998},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4124767780303955},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06941458582878113}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8624266982078552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6773124933242798},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5523937344551086},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4462790787220001},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4188392162322998},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4124767780303955},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06941458582878113},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.46298/dmtcs.627","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.627","pdf_url":"https://dmtcs.episciences.org/627/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.907.6776","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.907.6776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dmtcs.episciences.org/627/pdf/","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00990607v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00990607","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 1 (1), pp.75--92. ⟨10.46298/dmtcs.627⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:28a242f8a1734974b74424d435a465db","is_oa":true,"landing_page_url":"https://doaj.org/article/28a242f8a1734974b74424d435a465db","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 1, Iss Graph Theory (2013)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/dmtcs.627","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.627","pdf_url":"https://dmtcs.episciences.org/627/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6583422336","display_name":null,"funder_award_id":"77248","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2163178601.pdf"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W80657577","https://openalex.org/W841821653","https://openalex.org/W876312943","https://openalex.org/W1503376315","https://openalex.org/W1510730180","https://openalex.org/W1625967749","https://openalex.org/W1975405412","https://openalex.org/W2006892215","https://openalex.org/W2079014969","https://openalex.org/W2093497699","https://openalex.org/W2326337330","https://openalex.org/W2999464824","https://openalex.org/W6644014463","https://openalex.org/W6652235874"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4394650907","https://openalex.org/W4254119641","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864"],"abstract_inverted_index":{"Graph":[0],"Theory":[1],"Let":[2],"g(n)":[3,42,62,68,80,97],"denote":[4],"the":[5,27,72],"minimum":[6],"number":[7],"of":[8,10,16,29,35,71,76],"edges":[9],"a":[11],"maximal":[12,30],"nontraceable":[13,31],"(MNT)":[14],"graph":[15],"order":[17],"n.":[18],"In":[19],"2005":[20],"Frick":[21],"and":[22,59,96],"Singleton":[23],"(Lower":[24],"bound":[25],"for":[26,46,52,63,69,85,91,102],"size":[28],"graphs,":[32],"Electronic":[33],"Journal":[34],"Combinatorics,":[36],"12(1)":[37],"R32,":[38],"2005)":[39],"proved":[40],"that":[41,79],"=":[43,81,98],"\u23083n-22":[44],"\u2309":[45,84,101],"n":[47,53,64,86,92,103],"\u226554":[48,87],"as":[49,51,88,90,118,120],"well":[50,89,119],"\u2208I,":[54],"where":[55],"I=":[56],"12,13,22,23,30,31,38,39,":[57],"40,41,42,43,46,47,48,49,50,51":[58],"they":[60],"determined":[61],"\u22649.":[65],"We":[66,111],"determine":[67],"18":[70],"remaining":[73],"26":[74],"values":[75],"n,":[77],"showing":[78],"\u2308":[82,99],"3n-22":[83],"\u2208I":[93],"\u222a18,19,20,21,24,25,26,27,28,":[94],"29,32,33":[95],"3n2":[100],"\u2208":[104],"10,":[105],"11,":[106],"14,":[107],"15,":[108],"16,":[109],"17.":[110],"give":[112],"results":[113],"based":[114],"on":[115],"''analytic''":[116],"proofs":[117],"computer":[121],"searches.":[122]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}