{"id":"https://openalex.org/W1861232596","doi":"https://doi.org/10.37236/1946","title":"Decompositions of Graphs into 5-Cycles and Other Small Graphs","display_name":"Decompositions of Graphs into 5-Cycles and Other Small Graphs","publication_year":2005,"publication_date":"2005-09-29","ids":{"openalex":"https://openalex.org/W1861232596","doi":"https://doi.org/10.37236/1946","mag":"1861232596"},"language":"en","primary_location":{"id":"doi:10.37236/1946","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1946","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r49/pdf","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":null,"license_id":null,"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://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r49/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064010210","display_name":"Teresa Sousa","orcid":"https://orcid.org/0000-0002-3322-580X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Teresa Sousa","raw_affiliation_strings":["Tepper School of Business Carnegie Mellon University Pittsburgh, PA 15213","Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Tepper School of Business Carnegie Mellon University Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064010210"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.3628,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.63266626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"1","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":1.0,"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":1.0,"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.996999979019165,"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.9957000017166138,"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.8592623472213745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8459841012954712},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.6477986574172974},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5689738988876343},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4722798764705658},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47122135758399963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46984925866127014},{"id":"https://openalex.org/keywords/pancyclic-graph","display_name":"Pancyclic graph","score":0.4359559416770935},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4209528863430023},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3631388247013092}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8592623472213745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8459841012954712},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.6477986574172974},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5689738988876343},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4722798764705658},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47122135758399963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46984925866127014},{"id":"https://openalex.org/C166911692","wikidata":"https://www.wikidata.org/wiki/Q7130424","display_name":"Pancyclic graph","level":5,"score":0.4359559416770935},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4209528863430023},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3631388247013092}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.37236/1946","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1946","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r49/pdf","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.215.597","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/Volume_12/PDF/v12i1r49.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/1946","is_oa":true,"landing_page_url":"https://doi.org/10.37236/1946","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v12i1r49/pdf","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":null,"license_id":null,"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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1861232596.pdf","grobid_xml":"https://content.openalex.org/works/W1861232596.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1444168583","https://openalex.org/W2004308928","https://openalex.org/W2019480324","https://openalex.org/W2053420668","https://openalex.org/W2321467776","https://openalex.org/W2798588639","https://openalex.org/W2799004609"],"related_works":["https://openalex.org/W1555816812","https://openalex.org/W3139101777","https://openalex.org/W4385327816","https://openalex.org/W2083238533","https://openalex.org/W2061237693","https://openalex.org/W603403972","https://openalex.org/W4284883459","https://openalex.org/W3113857352","https://openalex.org/W1965252513","https://openalex.org/W2030683030"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4],"the":[5,9,43,48,50],"problem":[6],"of":[7,18,28,61],"finding":[8],"smallest":[10],"number":[11],"$q$":[12,39],"such":[13],"that":[14],"any":[15,56],"graph":[16,31,60],"$G$":[17],"order":[19,62],"$n$":[20],"admits":[21],"a":[22,29,53],"decomposition":[23],"into":[24],"edge":[25],"disjoint":[26],"copies":[27],"fixed":[30],"$H$":[32,46],"and":[33,55],"single":[34],"edges":[35],"with":[36,52],"at":[37],"most":[38],"elements.":[40],"We":[41],"solve":[42],"case":[44],"when":[45],"is":[47],"5-cycle,":[49],"5-cycle":[51],"chord":[54],"connected":[57],"non-bipartite":[58],"non-complete":[59],"4.":[63]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}