{"id":"https://openalex.org/W2022757574","doi":"https://doi.org/10.1017/s0963548302005497","title":"Contractible Elements in Graphs and Matroids","display_name":"Contractible Elements in Graphs and Matroids","publication_year":2003,"publication_date":"2003-07-01","ids":{"openalex":"https://openalex.org/W2022757574","doi":"https://doi.org/10.1017/s0963548302005497","mag":"2022757574"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548302005497","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548302005497","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5014610188","display_name":"Haidong Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I368840534","display_name":"University of Mississippi","ror":"https://ror.org/02teq1165","country_code":"US","type":"education","lineage":["https://openalex.org/I368840534","https://openalex.org/I4210141039"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"HAIDONG WU","raw_affiliation_strings":["Department of Mathematics, The University of Mississippi, University, MS 38677, USA (e-mail: [email\u00a0protected])#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The University of Mississippi, University, MS 38677, USA (e-mail: [email\u00a0protected])#TAB#","institution_ids":["https://openalex.org/I368840534"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014610188"],"corresponding_institution_ids":["https://openalex.org/I368840534"],"apc_list":null,"apc_paid":null,"fwci":0.3545,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59073835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"4","first_page":"457","last_page":"465"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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.9991000294685364,"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.9987000226974487,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9783999919891357,"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/contractible-space","display_name":"Contractible space","score":0.9604285955429077},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8302240967750549},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6714354157447815},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.669109582901001},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6337044835090637},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.47671741247177124},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4565197825431824},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4203135371208191},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.41780728101730347},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.41072165966033936},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09095478057861328}],"concepts":[{"id":"https://openalex.org/C169611556","wikidata":"https://www.wikidata.org/wiki/Q230689","display_name":"Contractible space","level":2,"score":0.9604285955429077},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8302240967750549},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6714354157447815},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.669109582901001},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6337044835090637},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.47671741247177124},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4565197825431824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4203135371208191},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.41780728101730347},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.41072165966033936},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09095478057861328}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548302005497","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548302005497","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1516768651","https://openalex.org/W1971578995","https://openalex.org/W1988512979","https://openalex.org/W2003051823","https://openalex.org/W2018831729","https://openalex.org/W2022720440","https://openalex.org/W2033985129","https://openalex.org/W2040101882","https://openalex.org/W2053058769","https://openalex.org/W2057927603","https://openalex.org/W2077628423","https://openalex.org/W2081599503"],"related_works":["https://openalex.org/W4291431691","https://openalex.org/W2094168923","https://openalex.org/W2016869408","https://openalex.org/W1974229618","https://openalex.org/W4320169601","https://openalex.org/W2796606627","https://openalex.org/W2162913605","https://openalex.org/W1970763039","https://openalex.org/W1991339404","https://openalex.org/W2347604631"],"abstract_inverted_index":{"Let":[0],"G":[1,16],"be":[2],"a":[3,26,59,72],"simple":[4,27],"3-connected":[5,60,116],"graph":[6,61],"with":[7],"at":[8,18,48,87],"least":[9,19,88],"five":[10],"vertices.":[11],"Tutte":[12],"[13]":[13],"showed":[14,33],"that":[15,34,45,51,70],"has":[17,86],"one":[20],"contractible":[21,35,56,80,103,113,124],"edge.":[22],"Thomassen":[23],"[11]":[24],"gave":[25],"proof":[28],"of":[29,109],"this":[30,41],"fact":[31],"and":[32,94],"edges":[36,57,114],"have":[37],"many":[38],"applications.":[39],"In":[40],"paper,":[42],"we":[43],"show":[44,69],"there":[46],"are":[47,52],"most":[49],"vertices":[50],"not":[53,76],"incident":[54,77,99],"to":[55,78,100],"in":[58,82,115],"G.":[62],"This":[63],"bound":[64],"is":[65,75,98],"best-possible.":[66],"We":[67,105,120,129],"also":[68,121],"if":[71],"vertex":[73],"v":[74,85],"any":[79],"edge":[81],"G,":[83],"then":[84],"four":[89],"neighbours":[90],"having":[91],"degree":[92],"three,":[93],"each":[95],"such":[96],"neighbour":[97],"exactly":[101],"two":[102],"edges.":[104],"give":[106],"short":[107],"proofs":[108],"several":[110],"results":[111],"on":[112],"graphs":[117],"as":[118],"well.":[119],"study":[122],"the":[123],"elements":[125],"for":[126,135],"k-connected":[127],"matroids.":[128,137],"partially":[130],"solve":[131],"an":[132],"open":[133],"problem":[134],"regular":[136]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}