{"id":"https://openalex.org/W2068932826","doi":"https://doi.org/10.1137/s0895480192242766","title":"On Path-Tough Graphs","display_name":"On Path-Tough Graphs","publication_year":1994,"publication_date":"1994-11-01","ids":{"openalex":"https://openalex.org/W2068932826","doi":"https://doi.org/10.1137/s0895480192242766","mag":"2068932826"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480192242766","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480192242766","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066897464","display_name":"Peter Dankelmann","orcid":"https://orcid.org/0000-0003-4376-7546"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Dankelmann","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109072211","display_name":"T. Nie\u00dfen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas Niessen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004220034","display_name":"Ingo Schiermeyer","orcid":"https://orcid.org/0000-0002-9226-8025"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ingo Schiermeyer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066897464"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.19333196,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"4","first_page":"571","last_page":"584"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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.9995999932289124,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8518027067184448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7737982273101807},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.703870415687561},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6312860250473022},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5284613966941833},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.5002636909484863},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.4818095564842224},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.4750092923641205},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47304266691207886},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4479576349258423},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4319019317626953},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.41743290424346924},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.34996500611305237},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21013200283050537},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.17727723717689514}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8518027067184448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7737982273101807},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.703870415687561},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6312860250473022},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5284613966941833},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.5002636909484863},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4818095564842224},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.4750092923641205},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47304266691207886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4479576349258423},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4319019317626953},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41743290424346924},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.34996500611305237},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21013200283050537},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.17727723717689514}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895480192242766","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480192242766","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:publications.rwth-aachen.de:180628","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/180628","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics 7(4), 571-584 (1994). doi:10.1137/S0895480192242766","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W96889678","https://openalex.org/W1484040084","https://openalex.org/W1544811519","https://openalex.org/W1801255175","https://openalex.org/W1967350548","https://openalex.org/W1971367602","https://openalex.org/W1975099798","https://openalex.org/W1981583245","https://openalex.org/W2003980189","https://openalex.org/W2019698871","https://openalex.org/W2035089435","https://openalex.org/W2038465558","https://openalex.org/W2056002585","https://openalex.org/W2066445698","https://openalex.org/W2113707442","https://openalex.org/W2129170614","https://openalex.org/W2319336783","https://openalex.org/W4256646394"],"related_works":["https://openalex.org/W1970462054","https://openalex.org/W2276107497","https://openalex.org/W142613662","https://openalex.org/W1785360057","https://openalex.org/W4297789824","https://openalex.org/W2951489338","https://openalex.org/W1963707128","https://openalex.org/W2092747350","https://openalex.org/W2072516858","https://openalex.org/W2283371316"],"abstract_inverted_index":{"A":[0],"graph":[1,15,34,81,108],"G":[2],"is":[3,50,57,76,109,111],"called":[4],"path-tough,":[5],"if,":[6],"for":[7],"each":[8],"nonempty":[9],"set":[10],"S":[11],"of":[12,35,65,86,104],"vertices,":[13,70],"the":[14,62,101],"$G":[16],"-":[17],"S$":[18],"can":[19],"be":[20],"covered":[21],"by":[22],"at":[23,41],"most":[24],"$|S|$":[25],"vertex":[26],"disjoint":[27],"paths.":[28],"The":[29,92],"authors":[30,93],"prove":[31,99],"that":[32,78,100],"every":[33,79],"order":[36],"n":[37],"and":[38,53,98],"minimum":[39],"degree":[40,63,87],"least":[42],"$[":[43],"3/(":[44],"6":[45],"+":[46],"\\sqrt{3}":[47],")":[48],"]n$":[49],"Hamiltonian":[51],"if":[52,55],"only":[54],"it":[56,75],"path-tough.":[58],"Similar":[59],"results":[60],"involving":[61],"sum":[64],"two":[66],"or":[67],"three":[68,83],"independent":[69,84],"respectively,":[71],"are":[72],"given.":[73],"Moreover,":[74],"shown":[77],"path-tough":[80,110],"without":[82],"vertices":[85],"2":[88],"contains":[89],"a":[90,106],"2-factor.":[91],"also":[94],"consider":[95],"complexity":[96],"aspects":[97],"decision":[102],"problem":[103],"whether":[105],"given":[107],"NP-complete.":[112]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}