{"id":"https://openalex.org/W2081397477","doi":"https://doi.org/10.1016/0095-8956(90)90081-a","title":"Cycles and paths of many lengths in bipartite digraphs","display_name":"Cycles and paths of many lengths in bipartite digraphs","publication_year":1990,"publication_date":"1990-12-01","ids":{"openalex":"https://openalex.org/W2081397477","doi":"https://doi.org/10.1016/0095-8956(90)90081-a","mag":"2081397477"},"language":"en","primary_location":{"id":"doi:10.1016/0095-8956(90)90081-a","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0095-8956(90)90081-a","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"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":"Journal of Combinatorial Theory, Series B","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/A5070237233","display_name":"Denise Amar","orcid":null},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Denise Amar","raw_affiliation_strings":["Universit\u00e9 de Bordeaux I, D\u00e9partement Informatique, 351, cours de la Lib\u00e9ration, 33405 Talence Cedex, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Bordeaux I, D\u00e9partement Informatique, 351, cours de la Lib\u00e9ration, 33405 Talence Cedex, France","institution_ids":["https://openalex.org/I15057530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111739071","display_name":"Yannis Manoussakis","orcid":null},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Yannis Manoussakis","raw_affiliation_strings":["Universit\u00e9 Paris-XI, L.R.I., b\u00e2t. 490, 91405 Orsay Cedex, France","Universit\u00e9 Paris XI, L.R.I., B\u00e2t. 490, 91405 Orsay Cedex, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-XI, L.R.I., b\u00e2t. 490, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I204730241"]},{"raw_affiliation_string":"Universit\u00e9 Paris XI, L.R.I., B\u00e2t. 490, 91405 Orsay Cedex, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I277688954"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070237233"],"corresponding_institution_ids":["https://openalex.org/I15057530"],"apc_list":{"value":3420,"currency":"USD","value_usd":3420},"apc_paid":null,"fwci":0.4944,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.65210399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"50","issue":"2","first_page":"254","last_page":"264"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.9307606816291809},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7959764003753662},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7446110248565674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.716810405254364},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4469805359840393},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.369201123714447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2075776755809784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1415848433971405}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9307606816291809},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7959764003753662},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7446110248565674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.716810405254364},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4469805359840393},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.369201123714447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2075776755809784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1415848433971405},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0095-8956(90)90081-a","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0095-8956(90)90081-a","pdf_url":null,"source":{"id":"https://openalex.org/S2939117604","display_name":"Journal of Combinatorial Theory Series B","issn_l":"0095-8956","issn":["0095-8956","1096-0902"],"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":"Journal of Combinatorial Theory, Series B","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":12,"referenced_works":["https://openalex.org/W1985542405","https://openalex.org/W1998152641","https://openalex.org/W2016474956","https://openalex.org/W2039505757","https://openalex.org/W2059065727","https://openalex.org/W2060817999","https://openalex.org/W2081397477","https://openalex.org/W2083864191","https://openalex.org/W2087159183","https://openalex.org/W2157737769","https://openalex.org/W6660332281","https://openalex.org/W6670672855"],"related_works":["https://openalex.org/W99690574","https://openalex.org/W2790788195","https://openalex.org/W2962785705","https://openalex.org/W4378505325","https://openalex.org/W2121104987","https://openalex.org/W4293584096","https://openalex.org/W4390409907","https://openalex.org/W2586280130","https://openalex.org/W4221143622","https://openalex.org/W1981723335"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"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"}