{"id":"https://openalex.org/W4236890056","doi":"https://doi.org/10.1002/jgt.20386","title":"Spanning even subgraphs of 3\u2010edge\u2010connected graphs","display_name":"Spanning even subgraphs of 3\u2010edge\u2010connected graphs","publication_year":2009,"publication_date":"2009-04-13","ids":{"openalex":"https://openalex.org/W4236890056","doi":"https://doi.org/10.1002/jgt.20386"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.20386","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5059315194","display_name":"Bill Jackson","orcid":"https://orcid.org/0000-0002-1381-8675"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bill Jackson","raw_affiliation_strings":["School of Mathematical Sciences, Queen Mary University of London, Mile End Road, London E1 4NS, United Kingdom"],"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, Queen Mary University of London, Mile End Road, London E1 4NS, United Kingdom","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080322469","display_name":"Kiyoshi Yoshimoto","orcid":"https://orcid.org/0000-0002-1142-375X"},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kiyoshi Yoshimoto","raw_affiliation_strings":["Department of Mathematics, College of Science and Technology, Nihon University, Tokyo 101-8308, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, College of Science and Technology, Nihon University, Tokyo 101-8308, Japan","institution_ids":["https://openalex.org/I104946051"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760,"provenance":"doaj"},"apc_paid":null,"fwci":0.601,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":13,"citation_normalized_percentile":{"value":0.818841,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":"62","issue":"1","first_page":"37","last_page":"47"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9999,"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.9999,"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.9993,"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.9941,"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/graph-factorization","display_name":"Graph factorization","score":0.5955157},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.50993216},{"id":"https://openalex.org/keywords/connected-component","display_name":"Connected component","score":0.44048384}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.845906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6863984},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5955157},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.50993216},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46995118},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.44048384},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3985571},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.37333775},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.21256581}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.20386","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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":10,"referenced_works":["https://openalex.org/W1786780942","https://openalex.org/W1977492432","https://openalex.org/W2033648541","https://openalex.org/W2038078172","https://openalex.org/W2061391997","https://openalex.org/W2068987903","https://openalex.org/W2335389215","https://openalex.org/W2569165198","https://openalex.org/W3000716540","https://openalex.org/W4241496210"],"related_works":["https://openalex.org/W4324266426","https://openalex.org/W4245682093","https://openalex.org/W2766774524","https://openalex.org/W2376177032","https://openalex.org/W2339652421","https://openalex.org/W2052731309","https://openalex.org/W1991452504","https://openalex.org/W1974819867","https://openalex.org/W18223240","https://openalex.org/W167435155"],"abstract_inverted_index":{"Abstract":[0],"By":[1],"Petersen's":[2],"theorem,":[3],"a":[4,9,32,50,88,91],"bridgeless":[5,17],"cubic":[6],"graph":[7,30],"has":[8,31,58,87],"2\u2010factor.":[10],"H.":[11],"Fleischner":[12],"extended":[13],"this":[14,66],"result":[15,38],"to":[16],"graphs":[18,80],"of":[19,45,78],"minimum":[20],"degree":[21],"at":[22,59],"least":[23,60],"three":[24],"by":[25,73],"showing":[26],"that":[27,65],"every":[28,56,83],"such":[29],"spanning":[33,51,84],"even":[34,52,85],"subgraph.":[35],"Our":[36],"main":[37],"is":[39,67],"that,":[40],"under":[41],"the":[42],"stronger":[43],"hypothesis":[44],"3\u2010edge\u2010connectivity,":[46],"we":[47],"can":[48],"find":[49],"subgraph":[53,86],"in":[54,68,81],"which":[55,82],"component":[57],"five":[61],"vertices.":[62],"We":[63],"show":[64],"some":[69],"sense":[70],"best":[71],"possible":[72],"constructing":[74],"an":[75],"infinite":[76],"family":[77],"3\u2010edge\u2010connected":[79],"5\u2010cycle":[89],"as":[90],"component.":[92],"\u00a9":[93],"2009":[94,103],"Wiley":[95],"Periodicals,":[96],"Inc.":[97],"J":[98],"Graph":[99],"Theory":[100],"62:":[101],"37\u201347,":[102]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4236890056","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-01-06T08:51:24.313322","created_date":"2022-05-12"}