{"id":"https://openalex.org/W2038143369","doi":"https://doi.org/10.1007/bf02122687","title":"Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching","display_name":"Solution to a problem of C. D. Godsil regarding bipartite graphs with unique perfect matching","publication_year":1989,"publication_date":"1989-03-01","ids":{"openalex":"https://openalex.org/W2038143369","doi":"https://doi.org/10.1007/bf02122687","mag":"2038143369"},"language":"en","primary_location":{"id":"doi:10.1007/bf02122687","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02122687","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","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/A5016533924","display_name":"Rodica Simion","orcid":null},"institutions":[{"id":"https://openalex.org/I193531525","display_name":"George Washington University","ror":"https://ror.org/00y4zzh67","country_code":"US","type":"education","lineage":["https://openalex.org/I193531525"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Simion","raw_affiliation_strings":["Department of Mathematics, George Washington University, 20052, Washington, D.C., USA","Department of Mathematics, George Washington University, Washington, D.C., USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, George Washington University, 20052, Washington, D.C., USA","institution_ids":["https://openalex.org/I193531525"]},{"raw_affiliation_string":"Department of Mathematics, George Washington University, Washington, D.C., USA","institution_ids":["https://openalex.org/I193531525"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052874005","display_name":"Dasong Cao","orcid":null},"institutions":[{"id":"https://openalex.org/I47720641","display_name":"Huazhong University of Science and Technology","ror":"https://ror.org/00p991c53","country_code":"CN","type":"education","lineage":["https://openalex.org/I47720641"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"D. -S. Cao","raw_affiliation_strings":["Mathematics Departement, Hua Zhong University of Science and Technology Wuhan, Hubei Province, People's Republic of China"],"affiliations":[{"raw_affiliation_string":"Mathematics Departement, Hua Zhong University of Science and Technology Wuhan, Hubei Province, People's Republic of China","institution_ids":["https://openalex.org/I47720641"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016533924"],"corresponding_institution_ids":["https://openalex.org/I193531525"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.17242261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"85","last_page":"89"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9890999794006348,"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/bipartite-graph","display_name":"Bipartite graph","score":0.9300581216812134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8954999446868896},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.8432477712631226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8285167217254639},{"id":"https://openalex.org/keywords/edge-transitive-graph","display_name":"Edge-transitive graph","score":0.6188584566116333},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5235195755958557},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5161370038986206},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.5124369263648987},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4931184947490692},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4894832372665405},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4730086624622345},{"id":"https://openalex.org/keywords/foster-graph","display_name":"Foster graph","score":0.4720904231071472},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.43510815501213074},{"id":"https://openalex.org/keywords/signed-graph","display_name":"Signed graph","score":0.4242165684700012},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.4120092988014221},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.366038978099823},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.23446622490882874}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9300581216812134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8954999446868896},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.8432477712631226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8285167217254639},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.6188584566116333},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5235195755958557},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5161370038986206},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.5124369263648987},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4931184947490692},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4894832372665405},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4730086624622345},{"id":"https://openalex.org/C68996132","wikidata":"https://www.wikidata.org/wiki/Q3115485","display_name":"Foster graph","level":5,"score":0.4720904231071472},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.43510815501213074},{"id":"https://openalex.org/C2779773260","wikidata":"https://www.wikidata.org/wiki/Q11246292","display_name":"Signed graph","level":3,"score":0.4242165684700012},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.4120092988014221},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.366038978099823},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.23446622490882874},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf02122687","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02122687","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"Combinatorica","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":3,"referenced_works":["https://openalex.org/W2017538877","https://openalex.org/W4213261054","https://openalex.org/W4243285511"],"related_works":["https://openalex.org/W3206955298","https://openalex.org/W2394181405","https://openalex.org/W2107875203","https://openalex.org/W2022808896","https://openalex.org/W2484006348","https://openalex.org/W2016639777","https://openalex.org/W2587954348","https://openalex.org/W2382285921","https://openalex.org/W4362599212","https://openalex.org/W2352066879"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
