{"id":"https://openalex.org/W4250859470","doi":"https://doi.org/10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7","title":"Extremal graphs in connectivity augmentation","display_name":"Extremal graphs in connectivity augmentation","publication_year":1999,"publication_date":"1999-07-01","ids":{"openalex":"https://openalex.org/W4250859470","doi":"https://doi.org/10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7"},"language":"en","primary_location":{"id":"doi:10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5108804667","display_name":"Tibor Jord\ufffdn","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tibor Jord\ufffdn","raw_affiliation_strings":["Department of Mathematics and Computer Science, Odense University, Campusvej 55, DK-5230, Odense, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Odense University, Campusvej 55, DK-5230, Odense, Denmark","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5108804667"],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.43282298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"31","issue":"3","first_page":"179","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.882836103439331},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7534023523330688},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6182246208190918},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6168738603591919},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.5265092253684998},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5028676390647888},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.49060264229774475},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45052817463874817},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42229944467544556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08940914273262024}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.882836103439331},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7534023523330688},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6182246208190918},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6168738603591919},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.5265092253684998},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5028676390647888},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.49060264229774475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45052817463874817},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42229944467544556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08940914273262024},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7","is_oa":false,"landing_page_url":"https://doi.org/10.1002/(sici)1097-0118(199907)31:3<179::aid-jgt3>3.0.co;2-7","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1516508621","https://openalex.org/W1988132050","https://openalex.org/W2010478727","https://openalex.org/W2018831729","https://openalex.org/W2028334693","https://openalex.org/W2048815229","https://openalex.org/W2049754879","https://openalex.org/W2062530569","https://openalex.org/W2102671623","https://openalex.org/W2125993726","https://openalex.org/W2159586130","https://openalex.org/W4210953350","https://openalex.org/W4298414065"],"related_works":["https://openalex.org/W3187181455","https://openalex.org/W2159586130","https://openalex.org/W2080725679","https://openalex.org/W2049969628","https://openalex.org/W2071797893","https://openalex.org/W1980648360","https://openalex.org/W4313216298","https://openalex.org/W1586160618","https://openalex.org/W349944016","https://openalex.org/W4250859470"],"abstract_inverted_index":{"Let":[0],"A(n,":[1,30,59],"k,":[2,31,38,60],"t)":[3,32],"denote":[4],"the":[5,42,72,76],"smallest":[6],"integer":[7],"e":[8,25],"for":[9,33,51,62],"which":[10],"every":[11],"k-connected":[12],"graph":[13],"on":[14],"n":[15,66],"vertices":[16],"can":[17],"be":[18],"made":[19],"(k":[20],"+":[21],"t)-connected":[22],"by":[23],"adding":[24],"new":[26],"edges.":[27],"We":[28,69],"determine":[29,58],"all":[34,63],"values":[35,64],"of":[36,44,65],"n,":[37],"and":[39,46,49,67],"t":[40],"in":[41],"case":[43],"(directed":[45],"undirected)":[47],"edge-connectivity":[48],"also":[50,70],"directed":[52],"vertex-connectivity.":[53],"For":[54],"undirected":[55],"vertex-connectivity":[56],"we":[57],"1)":[61],"k.":[68],"describe":[71],"graphs":[73],"that":[74],"attain":[75],"extremal":[77],"values.":[78],"\u00a9":[79],"1999":[80,91],"John":[81],"Wiley":[82],"&":[83],"Sons,":[84],"Inc.":[85],"J":[86],"Graph":[87],"Theory":[88],"31:":[89],"179\u2013193,":[90]},"counts_by_year":[],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}