{"id":"https://openalex.org/W1859687026","doi":"https://doi.org/10.1142/s1793830915500263","title":"Hamilton cycle rich 2-factorization of complete bipartite graphs","display_name":"Hamilton cycle rich 2-factorization of complete bipartite graphs","publication_year":2015,"publication_date":"2015-06-04","ids":{"openalex":"https://openalex.org/W1859687026","doi":"https://doi.org/10.1142/s1793830915500263","mag":"1859687026"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830915500263","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500263","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5101562740","display_name":"R. Sangeetha","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. Sangeetha","raw_affiliation_strings":["Department of Mathematics, A.V.V.M. Sri Pushpam College, Poondi, Thanjavur Dt., Tamil Nadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, A.V.V.M. Sri Pushpam College, Poondi, Thanjavur Dt., Tamil Nadu, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019767048","display_name":"A. Muthusamy","orcid":"https://orcid.org/0000-0001-9014-6916"},"institutions":[{"id":"https://openalex.org/I141431873","display_name":"Periyar University","ror":"https://ror.org/05crs8s98","country_code":"IN","type":"education","lineage":["https://openalex.org/I141431873"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"A. Muthusamy","raw_affiliation_strings":["Department of Mathematics, Periyar University, Salem, Tamilnadu, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Periyar University, Salem, Tamilnadu, India","institution_ids":["https://openalex.org/I141431873"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101562740"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04493354,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"07","issue":"03","first_page":"1550026","last_page":"1550026"},"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.9998999834060669,"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.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9574999809265137,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10849","display_name":"Finite Group Theory Research","score":0.9480000138282776,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8397809267044067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7938574552536011},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.7147703766822815},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6757512092590332},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6188229322433472},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5098758935928345},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.480574369430542},{"id":"https://openalex.org/keywords/complete-graph","display_name":"Complete graph","score":0.469279408454895},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41850125789642334},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32627207040786743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05901464819908142},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.045414358377456665}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8397809267044067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7938574552536011},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.7147703766822815},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6757512092590332},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6188229322433472},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5098758935928345},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.480574369430542},{"id":"https://openalex.org/C125080357","wikidata":"https://www.wikidata.org/wiki/Q45715","display_name":"Complete graph","level":3,"score":0.469279408454895},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41850125789642334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32627207040786743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05901464819908142},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.045414358377456665},{"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.1142/s1793830915500263","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500263","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320767","display_name":"University Grants Commission","ror":"https://ror.org/04p800546"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1993530821","https://openalex.org/W2002197583","https://openalex.org/W2009698418","https://openalex.org/W2038921999","https://openalex.org/W2045234274","https://openalex.org/W2050766415","https://openalex.org/W2058006167","https://openalex.org/W2073254963"],"related_works":["https://openalex.org/W2355185940","https://openalex.org/W2091826982","https://openalex.org/W245205139","https://openalex.org/W2365751441","https://openalex.org/W2036057584","https://openalex.org/W4246000090","https://openalex.org/W2516280752","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W4389471461"],"abstract_inverted_index":{"A":[0],"2-factorization":[1,36,59],"{F":[2,60],"1":[3,61,74,77,99],",":[4,62,78,96],"F":[5,24,63,73,79,87],"2":[6,64,80,83,102],",\u2026,F":[7,65],"d":[8],"}":[9,67],"of":[10,37,48,68,93,109,125,130,158],"a":[11,58],"2d-regular":[12],"graph":[13,136],"G":[14,40,76,82,98,101],"such":[15,71],"that":[16,55,72,156],"each":[17,141],"[Formula:":[18],"see":[19],"text]":[20],"and":[21,84,100,169],"the":[22,44,85,104,119,123,133,154,159,164,170],"remaining":[23,86,171],"i":[25,41,88],"'s":[26,42,89],"are":[27,43,90,103,161,172],"all":[28],"Hamilton":[29,33,91,126,173],"cycles":[30,92],"is":[31],"called":[32],"cycle":[34,127],"rich":[35,128],"G,":[38],"where":[39,97],"given":[45,105,165],"non-isomorphic":[46,107,167],"2-factors":[47,108,160,168],"G.":[49],"In":[50,113],"this":[51],"paper,":[52],"we":[53],"prove":[54],"there":[56],"exists":[57],"n":[66],"K":[69,94,110],"2n,2n":[70,95,111],"\u2245":[75,81],"two":[106,157,166],".":[112],"fact":[114],"our":[115],"result":[116],"together":[117],"with":[118,137],"earlier":[120],"results":[121],"settles":[122],"existence":[124],"2-factorizations":[129],"K(m,":[131],"p),":[132],"complete":[134],"p-partite":[135],"m":[138],"vertices":[139],"in":[140,153],"partite":[142],"set,":[143],"except":[144],"when":[145],"(m,":[146],"p)":[147],"=":[148],"(2n":[149],"+":[150],"1,":[151],"2),":[152],"case":[155],"isomorphic":[162],"to":[163],"cycles.":[174]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}