iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.openalex.org/works/doi:10.1002/JGT.20349
{"id":"https://openalex.org/W4245296112","doi":"https://doi.org/10.1002/jgt.20349","title":"Disjoint cycles with chords in graphs","display_name":"Disjoint cycles with chords in graphs","publication_year":2008,"publication_date":"2008-09-15","ids":{"openalex":"https://openalex.org/W4245296112","doi":"https://doi.org/10.1002/jgt.20349"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.20349","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5082756334","display_name":"Ch. Sobhan Babu","orcid":"https://orcid.org/0000-0003-1645-8502"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ch. Sobhan Babu","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041941673","display_name":"Ajit A. Diwan","orcid":"https://orcid.org/0000-0001-9381-7164"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ajit A. Diwan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Powai, Mumbai 400076, India","institution_ids":["https://openalex.org/I162827531"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3760,"currency":"USD","value_usd":3760,"provenance":"doaj"},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":4,"citation_normalized_percentile":{"value":0.570671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":76,"max":78},"biblio":{"volume":"60","issue":"2","first_page":"87","last_page":"98"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998,"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.9998,"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/T10374","display_name":"Graph Theory and Algorithms","score":0.9994,"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.9984,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6176475},{"id":"https://openalex.org/keywords/hypergraphs","display_name":"Hypergraphs","score":0.552642}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9073882},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.73479563},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.61988527},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6176475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5569065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36837864}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.20349","pdf_url":null,"source":{"id":"https://openalex.org/S193368155","display_name":"Journal of Graph Theory","issn_l":"0364-9024","issn":["0364-9024","1097-0118"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":8,"referenced_works":["https://openalex.org/W1991387851","https://openalex.org/W1991452738","https://openalex.org/W2001686801","https://openalex.org/W2035570915","https://openalex.org/W2041854775","https://openalex.org/W2049309804","https://openalex.org/W2113726792","https://openalex.org/W3141776272"],"related_works":["https://openalex.org/W4308716484","https://openalex.org/W4256429076","https://openalex.org/W2587900963","https://openalex.org/W2348092930","https://openalex.org/W2099195351","https://openalex.org/W2098284475","https://openalex.org/W2062850566","https://openalex.org/W2012063272","https://openalex.org/W1971174658","https://openalex.org/W1553466895"],"abstract_inverted_index":{"Abstract":[0],"Let":[1],"$n_1,n_2,\\ldots,n_k$":[2],"be":[3,20],"integers,":[4],"$n=\\sum":[5],"n_i$":[6],",":[7,10,18,52,55],"$n_i\\ge":[8],"3$":[9],"and":[11,61],"let":[12],"for":[13],"each":[14],"$1\\le":[15],"i\\le":[16],"k$":[17],"$H_i$":[19,57,75],"a":[21,24,59,64,71,77],"cycle":[22,65],"or":[23],"tree":[25],"on":[26],"$n_i$":[27],"vertices.":[28],"We":[29],"prove":[30],"that":[31],"every":[32],"graph":[33],"G":[34],"of":[35],"order":[36],"at":[37],"least":[38],"n":[39],"with":[40,66,70],"$\\sigma_2(G)":[41],"\\ge":[42],"2(":[43],"n-k)":[44],"-1$":[45],"contains":[46],"k":[47],"vertex":[48],"disjoint":[49],"subgraphs":[50],"$H_1',H_2',\\ldots,H_k'$":[51],"where":[53],"$H_i'=H_i$":[54],"if":[56,74],"is":[58,63,76],"tree,":[60],"$H_i'$":[62],"$n_i-3$":[67],"chords":[68],"incident":[69],"common":[72],"vertex,":[73],"cycle.":[78],"\u00a9":[79],"2008":[80],"Wiley":[81],"Periodicals,":[82],"Inc.":[83],"J":[84],"Graph":[85],"Theory":[86],"60:":[87],"87\u201398,":[88],"2009":[89]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4245296112","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2024-10-08T02:46:15.666178","created_date":"2022-05-12"}