{"id":"https://openalex.org/W2766774524","doi":"https://doi.org/10.37236/5660","title":"Even Cycles and Even 2-Factors in the Line Graph of a Simple Graph","display_name":"Even Cycles and Even 2-Factors in the Line Graph of a Simple Graph","publication_year":2017,"publication_date":"2017-10-20","ids":{"openalex":"https://openalex.org/W2766774524","doi":"https://doi.org/10.37236/5660","mag":"2766774524"},"language":"en","primary_location":{"id":"doi:10.37236/5660","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5660","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.37236/5660","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058228193","display_name":"Arrigo Bonisoli","orcid":"https://orcid.org/0000-0003-4031-7806"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Arrigo Bonisoli","raw_affiliation_strings":["Universit\u00e0 di Modena e Reggio Emilia"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Modena e Reggio Emilia","institution_ids":["https://openalex.org/I122346577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030010535","display_name":"Simona Bonvicini","orcid":"https://orcid.org/0000-0001-5318-7866"},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Simona Bonvicini","raw_affiliation_strings":["Universit\u00e0 di Modena e Reggio Emilia"],"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Modena e Reggio Emilia","institution_ids":["https://openalex.org/I122346577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058228193"],"corresponding_institution_ids":["https://openalex.org/I122346577"],"apc_list":null,"apc_paid":null,"fwci":0.146,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.53150486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":"4","first_page":null,"last_page":null},"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.9988999962806702,"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.9988999962806702,"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.9983999729156494,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8625270128250122},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8208572268486023},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.6933454275131226},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5692922472953796},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5166156888008118},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4969363510608673},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4949631094932556},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46914878487586975},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4644472897052765},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4033506512641907}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8625270128250122},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8208572268486023},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.6933454275131226},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5692922472953796},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5166156888008118},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4969363510608673},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4949631094932556},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46914878487586975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4644472897052765},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4033506512641907}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/5660","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5660","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:iris.unimore.it:11380/1146051","is_oa":true,"landing_page_url":"http://hdl.handle.net/11380/1146051","pdf_url":null,"source":{"id":"https://openalex.org/S4306400718","display_name":"IRIS UNIMORE (University of Modena and Reggio Emilia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122346577","host_organization_name":"University of Modena and Reggio Emilia","host_organization_lineage":["https://openalex.org/I122346577"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.37236/5660","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5660","pdf_url":null,"source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"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/W2393701947","https://openalex.org/W2953496651","https://openalex.org/W3208942821","https://openalex.org/W2886672068","https://openalex.org/W4285101991","https://openalex.org/W4324266426","https://openalex.org/W2738209622","https://openalex.org/W2404212820","https://openalex.org/W1979280995","https://openalex.org/W2978860557"],"abstract_inverted_index":{"Let":[0],"$G$":[1,19,36],"be":[2,85],"a":[3,28,38,52,59],"connected":[4,41,92],"graph":[5,34,54,69],"with":[6],"an":[7,72],"even":[8,46,49,73,97,107],"number":[9],"of":[10,18,24,35,45,76,82,96,103,106,110],"edges.":[11],"We":[12],"show":[13],"that":[14,65],"if":[15],"the":[16,22,32,66,80,104],"subgraph":[17],"induced":[20],"by":[21],"vertices":[23],"odd":[25],"degree":[26],"has":[27,37,71],"perfect":[29],"matching,":[30],"then":[31],"line":[33,68],"$2$-factor":[39],"whose":[40,91],"components":[42,93],"are":[43,94],"cycles":[44,95],"length":[47],"(an":[48],"$2$-factor).":[50],"For":[51],"cubic":[53],"$G$,":[55],"we":[56],"also":[57,117],"give":[58],"necessary":[60],"and":[61],"sufficient":[62],"condition":[63],"so":[64],"corresponding":[67],"$L(G)$":[70,83],"cycle":[74,108],"decomposition":[75],"index":[77,111],"$3$,":[78],"i.e.,":[79],"edge-set":[81],"can":[84],"partitioned":[86],"into":[87],"three":[88],"$2$-regular":[89],"subgraphs":[90],"length.":[98],"The":[99],"more":[100],"general":[101],"problem":[102],"existence":[105],"decompositions":[109],"$m$":[112],"in":[113],"$2d$-regular":[114],"graphs":[115],"is":[116],"addressed.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}