{"id":"https://openalex.org/W2055349318","doi":"https://doi.org/10.1137/060663337","title":"Eulerian Subgraphs Containing Given Vertices","display_name":"Eulerian Subgraphs Containing Given Vertices","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2055349318","doi":"https://doi.org/10.1137/060663337","mag":"2055349318"},"language":"en","primary_location":{"id":"doi:10.1137/060663337","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060663337","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/A5100423055","display_name":"Zhao Zhang","orcid":"https://orcid.org/0000-0003-4191-7598"},"institutions":[{"id":"https://openalex.org/I96908189","display_name":"Xinjiang University","ror":"https://ror.org/059gw8r13","country_code":"CN","type":"education","lineage":["https://openalex.org/I96908189"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhao Zhang","raw_affiliation_strings":["Xinjiang University"],"affiliations":[{"raw_affiliation_string":"Xinjiang University","institution_ids":["https://openalex.org/I96908189"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100348509","display_name":"Hao Li","orcid":"https://orcid.org/0000-0001-8502-2556"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Hao Li","raw_affiliation_strings":["Laboratory for Computer Science (University of Paris-Sud)"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science (University of Paris-Sud)","institution_ids":["https://openalex.org/I102197404"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100423055"],"corresponding_institution_ids":["https://openalex.org/I96908189"],"apc_list":null,"apc_paid":null,"fwci":0.3138,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59606176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"2","first_page":"611","last_page":"621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/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/T10829","display_name":"Interconnection Networks and Systems","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8022440671920776},{"id":"https://openalex.org/keywords/eulerian-path","display_name":"Eulerian path","score":0.785769522190094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7162610292434692},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.658055305480957},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.542027473449707},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5245991945266724},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44338223338127136},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4350183606147766},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.41119584441185},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40743887424468994},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.17025336623191833},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11941635608673096},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.05773565173149109}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8022440671920776},{"id":"https://openalex.org/C43058520","wikidata":"https://www.wikidata.org/wiki/Q624580","display_name":"Eulerian path","level":3,"score":0.785769522190094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7162610292434692},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.658055305480957},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.542027473449707},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5245991945266724},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44338223338127136},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4350183606147766},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.41119584441185},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40743887424468994},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.17025336623191833},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11941635608673096},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.05773565173149109},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/060663337","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060663337","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1569752386","https://openalex.org/W1584148193","https://openalex.org/W1971367602","https://openalex.org/W1983496943","https://openalex.org/W1994038438","https://openalex.org/W2004308928","https://openalex.org/W2007994029","https://openalex.org/W2011395621","https://openalex.org/W2022190032","https://openalex.org/W2035913199","https://openalex.org/W2053749941","https://openalex.org/W2064702321","https://openalex.org/W2070507337","https://openalex.org/W2087818742","https://openalex.org/W2088547222","https://openalex.org/W2137952152","https://openalex.org/W3047875033","https://openalex.org/W3048161741","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4287869573","https://openalex.org/W2129100545","https://openalex.org/W3004984242","https://openalex.org/W2039200643","https://openalex.org/W2122901591","https://openalex.org/W2093066148","https://openalex.org/W2348698268","https://openalex.org/W2349332978","https://openalex.org/W1988376039","https://openalex.org/W600528036"],"abstract_inverted_index":{"A":[0],"vertex":[1,23],"set":[2,24],"is":[3],"-weak-edge-connected":[4,22],"if,":[5],"for":[6],"every":[7],"and":[8,20,26],",":[9,27],"there":[10],"are":[11],"edge-disjoint":[12],"(,":[13],")-paths":[14],"in":[15,38],".":[16,39],"For":[17],"a":[18,21],"graph":[19],"with":[25],"we":[28],"show":[29],"that":[30],"has":[31],"an":[32],"Eulerian":[33],"subgraph":[34],"containing":[35],"all":[36],"vertices":[37]},"counts_by_year":[{"year":2021,"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"}