{"id":"https://openalex.org/W2137937061","doi":"https://doi.org/10.1002/jgt.3190060413","title":"A sufficient condition for a graph to contain three disjoint 1\u2010factors","display_name":"A sufficient condition for a graph to contain three disjoint 1\u2010factors","publication_year":1982,"publication_date":"1982-12-01","ids":{"openalex":"https://openalex.org/W2137937061","doi":"https://doi.org/10.1002/jgt.3190060413","mag":"2137937061"},"language":"en","primary_location":{"id":"doi:10.1002/jgt.3190060413","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190060413","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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/A5013247303","display_name":"Sein Win","orcid":null},"institutions":[{"id":"https://openalex.org/I90678064","display_name":"University of Colombo","ror":"https://ror.org/02phn5242","country_code":"LK","type":"education","lineage":["https://openalex.org/I90678064"]}],"countries":["LK"],"is_corresponding":true,"raw_author_name":"Sein Win","raw_affiliation_strings":["University of Colombo Colombo, Sri Lanka","( University of Colombo Colombo Sri Lanka )"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colombo Colombo, Sri Lanka","institution_ids":["https://openalex.org/I90678064"]},{"raw_affiliation_string":"( University of Colombo Colombo Sri Lanka )","institution_ids":["https://openalex.org/I90678064"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013247303"],"corresponding_institution_ids":["https://openalex.org/I90678064"],"apc_list":{"value":3760,"currency":"USD","value_usd":3760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.23764202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"6","issue":"4","first_page":"489","last_page":"492"},"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.9984999895095825,"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.9984999895095825,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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.9912999868392944,"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.7596392035484314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7376987934112549},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6696277260780334},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.621791660785675},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5685601234436035},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.4775443971157074},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40782228112220764},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.38026079535484314},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12873601913452148}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7596392035484314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7376987934112549},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6696277260780334},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.621791660785675},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5685601234436035},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.4775443971157074},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40782228112220764},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.38026079535484314},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12873601913452148}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/jgt.3190060413","is_oa":false,"landing_page_url":"https://doi.org/10.1002/jgt.3190060413","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Theory","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":2,"referenced_works":["https://openalex.org/W2012896465","https://openalex.org/W2090631440"],"related_works":["https://openalex.org/W2057580655","https://openalex.org/W4388585714","https://openalex.org/W2373602382","https://openalex.org/W2169450198","https://openalex.org/W3107311856","https://openalex.org/W2083864191","https://openalex.org/W2952856011","https://openalex.org/W203133463","https://openalex.org/W2910028469","https://openalex.org/W4287558340"],"abstract_inverted_index":{"Abstract":[0],"Ore":[1],"derived":[2],"a":[3,7,11,16,24,28,32],"sufficient":[4,17],"condition":[5],"for":[6,23],"graph":[8,25],"to":[9,20,26],"contain":[10,27],"Hamiltonian":[12,29],"cycle.":[13],"We":[14],"obtain":[15],"condition,":[18,22],"similar":[19],"Ore's":[21],"cycle":[30],"and":[31],"1\u2010factor":[33],"which":[34],"are":[35],"edge":[36],"disjoint.":[37]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}