{"id":"https://openalex.org/W2077018265","doi":"https://doi.org/10.1016/s0012-365x(99)00047-3","title":"Bipartite graphs containing every possible pair of cycles","display_name":"Bipartite graphs containing every possible pair of cycles","publication_year":1999,"publication_date":"1999-09-01","ids":{"openalex":"https://openalex.org/W2077018265","doi":"https://doi.org/10.1016/s0012-365x(99)00047-3","mag":"2077018265"},"language":"en","primary_location":{"id":"doi:10.1016/s0012-365x(99)00047-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(99)00047-3","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5100370975","display_name":"Hong Wang","orcid":"https://orcid.org/0000-0003-0803-1111"},"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, ID, 83844, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, The University of Idaho, Moscow, ID, 83844, USA","institution_ids":["https://openalex.org/I155093810"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100370975"],"corresponding_institution_ids":["https://openalex.org/I155093810"],"apc_list":{"value":3000,"currency":"USD","value_usd":3000},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.17332601,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"207","issue":"1-3","first_page":"233","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9995999932289124,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9952999949455261,"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.9835000038146973,"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/combinatorics","display_name":"Combinatorics","score":0.9100963473320007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8856920599937439},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8363566398620605},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6833802461624146},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6217923164367676},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5412106513977051},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4850980043411255},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4778949022293091},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45349204540252686}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9100963473320007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8856920599937439},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8363566398620605},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6833802461624146},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6217923164367676},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5412106513977051},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4850980043411255},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4778949022293091},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45349204540252686}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0012-365x(99)00047-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0012-365x(99)00047-3","pdf_url":null,"source":{"id":"https://openalex.org/S18902827","display_name":"Discrete Mathematics","issn_l":"0012-365X","issn":["0012-365X","1872-681X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics","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":0,"referenced_works":[],"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/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W2910933086","https://openalex.org/W3143578817","https://openalex.org/W4288630335"],"abstract_inverted_index":null,"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}