{"id":"https://openalex.org/W2025531703","doi":"https://doi.org/10.1007/s00373-012-1230-7","title":"On Unicyclic Graphs with Uniquely Restricted Maximum Matchings","display_name":"On Unicyclic Graphs with Uniquely Restricted Maximum Matchings","publication_year":2012,"publication_date":"2012-10-11","ids":{"openalex":"https://openalex.org/W2025531703","doi":"https://doi.org/10.1007/s00373-012-1230-7","mag":"2025531703"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-012-1230-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1230-7","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/A5085909262","display_name":"Vadim E. Levit","orcid":"https://orcid.org/0000-0002-4190-7050"},"institutions":[{"id":"https://openalex.org/I52170813","display_name":"Ariel University","ror":"https://ror.org/03nz8qe97","country_code":"IL","type":"education","lineage":["https://openalex.org/I52170813"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Vadim E. Levit","raw_affiliation_strings":["Department of Computer Science and Mathematics, Ariel University Center of Samaria, Ariel, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Mathematics, Ariel University Center of Samaria, Ariel, Israel","institution_ids":["https://openalex.org/I52170813"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039762286","display_name":"Eugen M\u00e2ndrescu","orcid":"https://orcid.org/0000-0003-3533-9728"},"institutions":[{"id":"https://openalex.org/I157943965","display_name":"Holon Institute of Technology","ror":"https://ror.org/02prqh017","country_code":"IL","type":"education","lineage":["https://openalex.org/I157943965"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eugen Mandrescu","raw_affiliation_strings":["Department of Computer Science, Holon Institute of Technology, Holon, Israel","Department of Computer Science, Holon Institute of Technology, Holon, Israel;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Holon Institute of Technology, Holon, Israel","institution_ids":["https://openalex.org/I157943965"]},{"raw_affiliation_string":"Department of Computer Science, Holon Institute of Technology, Holon, Israel;","institution_ids":["https://openalex.org/I157943965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085909262"],"corresponding_institution_ids":["https://openalex.org/I52170813"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09675625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"29","issue":"6","first_page":"1867","last_page":"1879"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.998199999332428,"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.9979000091552734,"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.9103888869285583},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.815601110458374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8021119832992554},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5759178400039673},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5607600808143616},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.4730103313922882},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4710930287837982},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.468142569065094},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.42681100964546204},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24231943488121033},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13253450393676758},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.07564377784729004}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9103888869285583},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.815601110458374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8021119832992554},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5759178400039673},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5607600808143616},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.4730103313922882},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4710930287837982},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.468142569065094},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.42681100964546204},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24231943488121033},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13253450393676758},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.07564377784729004},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00373-012-1230-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1230-7","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W130424845","https://openalex.org/W159487651","https://openalex.org/W1653862302","https://openalex.org/W1990446008","https://openalex.org/W1994927309","https://openalex.org/W2000304327","https://openalex.org/W2002427023","https://openalex.org/W2013415302","https://openalex.org/W2015646807","https://openalex.org/W2044089009","https://openalex.org/W2052621607","https://openalex.org/W2052768371","https://openalex.org/W2078342963","https://openalex.org/W2137468109","https://openalex.org/W4250204379"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2352066879","https://openalex.org/W4300919538","https://openalex.org/W2184969544","https://openalex.org/W2949735222","https://openalex.org/W2167462019","https://openalex.org/W4320022211","https://openalex.org/W2382570307","https://openalex.org/W2366256543","https://openalex.org/W2071364952"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}