{"id":"https://openalex.org/W2065827903","doi":"https://doi.org/10.1007/s003730200008","title":"Upper Bounds to the Number of Vertices in a k -Critically n -Connected Graph","display_name":"Upper Bounds to the Number of Vertices in a k -Critically n -Connected Graph","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W2065827903","doi":"https://doi.org/10.1007/s003730200008","mag":"2065827903"},"language":"en","primary_location":{"id":"doi:10.1007/s003730200008","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s003730200008","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","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/A5037836325","display_name":"Matthias Kriesell","orcid":"https://orcid.org/0000-0002-7302-7496"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Matthias Kriesell","raw_affiliation_strings":["Institut f\u00fcr Mathematik (A), University of Hannover, Welfengarten 1, D-30167 Hannover, Germany. e-mail: kriesell@math.uni-hannover.de, , , , , , DE","Institut f\u00fcr Mathematik (A), University of Hannover, Welfengarten 1, D-30167 Hannover, Germany. e-mail: kriesell@math.uni-hannover.de, DE"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik (A), University of Hannover, Welfengarten 1, D-30167 Hannover, Germany. e-mail: kriesell@math.uni-hannover.de, , , , , , DE","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Institut f\u00fcr Mathematik (A), University of Hannover, Welfengarten 1, D-30167 Hannover, Germany. e-mail: kriesell@math.uni-hannover.de, DE","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037836325"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.0495,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75695785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"1","first_page":"133","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9984999895095825,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8364632725715637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7787487506866455},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5947767496109009},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.5412759780883789},{"id":"https://openalex.org/keywords/bound-graph","display_name":"Bound graph","score":0.5257015228271484},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.5213671922683716},{"id":"https://openalex.org/keywords/distance-regular-graph","display_name":"Distance-regular graph","score":0.5144417881965637},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5107078552246094},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4773978292942047},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.4643877446651459},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44575172662734985},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4388822019100189},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.34072357416152954}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8364632725715637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7787487506866455},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5947767496109009},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.5412759780883789},{"id":"https://openalex.org/C121134508","wikidata":"https://www.wikidata.org/wiki/Q4949882","display_name":"Bound graph","level":5,"score":0.5257015228271484},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.5213671922683716},{"id":"https://openalex.org/C56783289","wikidata":"https://www.wikidata.org/wiki/Q3115556","display_name":"Distance-regular graph","level":5,"score":0.5144417881965637},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5107078552246094},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4773978292942047},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.4643877446651459},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44575172662734985},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4388822019100189},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.34072357416152954}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s003730200008","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s003730200008","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:hdl:10068/182885","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/182885","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2982283786","https://openalex.org/W4298388358","https://openalex.org/W2004791814","https://openalex.org/W2945649202","https://openalex.org/W3022348726","https://openalex.org/W2065827903","https://openalex.org/W2973035702","https://openalex.org/W2296996162","https://openalex.org/W2794508120","https://openalex.org/W2744051602"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}