{"id":"https://openalex.org/W1971468615","doi":"https://doi.org/10.1007/s00493-005-0021-7","title":"Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs","display_name":"Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs","publication_year":2005,"publication_date":"2005-05-01","ids":{"openalex":"https://openalex.org/W1971468615","doi":"https://doi.org/10.1007/s00493-005-0021-7","mag":"1971468615"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-005-0021-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-005-0021-7","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/A5101750925","display_name":"Hong Wang","orcid":"https://orcid.org/0000-0001-9136-8959"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hong Wang","raw_affiliation_strings":["Department of Mathematics, The University of Idaho, Moscow, Idaho 83844, USA","Department of Mathematics, The University of Idaho, Moscow, Idaho, 83844 USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The University of Idaho, Moscow, Idaho 83844, USA","institution_ids":["https://openalex.org/I155093810"]},{"raw_affiliation_string":"Department of Mathematics, The University of Idaho, Moscow, Idaho, 83844 USA","institution_ids":["https://openalex.org/I155093810"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101750925"],"corresponding_institution_ids":["https://openalex.org/I155093810"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.07472826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"25","issue":"3","first_page":"367","last_page":"377"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9984999895095825,"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/T11476","display_name":"Graph theory and applications","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.9133555889129639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8868902325630188},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8244979381561279},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6447165012359619},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5276083946228027},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5030931830406189},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.45023027062416077},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4501032531261444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3844308853149414},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1273200511932373},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.10137280821800232}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9133555889129639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8868902325630188},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8244979381561279},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6447165012359619},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5276083946228027},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5030931830406189},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.45023027062416077},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4501032531261444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3844308853149414},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1273200511932373},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.10137280821800232}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00493-005-0021-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-005-0021-7","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":10,"referenced_works":["https://openalex.org/W1510730180","https://openalex.org/W1971367602","https://openalex.org/W1994422705","https://openalex.org/W1997341083","https://openalex.org/W2031355698","https://openalex.org/W2033014804","https://openalex.org/W2041660565","https://openalex.org/W2062272196","https://openalex.org/W2094126876","https://openalex.org/W2752109416"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2036057584","https://openalex.org/W4246000090","https://openalex.org/W2107875203","https://openalex.org/W2096364584","https://openalex.org/W2177700890","https://openalex.org/W2350213812","https://openalex.org/W1977678149","https://openalex.org/W4240697234"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"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"}