{"id":"https://openalex.org/W2760134669","doi":"https://doi.org/10.37236/6156","title":"Gr\u00f6bner Bases Techniques for an $S$-Packing $k$-Coloring of a Graph","display_name":"Gr\u00f6bner Bases Techniques for an $S$-Packing $k$-Coloring of a Graph","publication_year":2017,"publication_date":"2017-08-25","ids":{"openalex":"https://openalex.org/W2760134669","doi":"https://doi.org/10.37236/6156","mag":"2760134669"},"language":"en","primary_location":{"id":"doi:10.37236/6156","is_oa":true,"landing_page_url":"https://doi.org/10.37236/6156","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/6156","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061123345","display_name":"Hamid Ma\u00e2rouf","orcid":null},"institutions":[{"id":"https://openalex.org/I119856527","display_name":"Cadi Ayyad University","ror":"https://ror.org/04xf6nm78","country_code":"MA","type":"education","lineage":["https://openalex.org/I119856527"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Hamid Maarouf","raw_affiliation_strings":["Cadi Ayyad University"],"affiliations":[{"raw_affiliation_string":"Cadi Ayyad University","institution_ids":["https://openalex.org/I119856527"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061123345"],"corresponding_institution_ids":["https://openalex.org/I119856527"],"apc_list":null,"apc_paid":null,"fwci":0.2867,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59896344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"3","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.9980999827384949,"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.9980999827384949,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11435","display_name":"Polynomial and algebraic computation","score":0.9650999903678894,"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/mathematics","display_name":"Mathematics","score":0.7877588868141174},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7505798935890198},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6696673631668091},{"id":"https://openalex.org/keywords/chromatic-polynomial","display_name":"Chromatic polynomial","score":0.5044606924057007},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.4710250794887543},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4524180293083191},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4486980140209198},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.21742025017738342},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1416652798652649}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7877588868141174},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7505798935890198},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6696673631668091},{"id":"https://openalex.org/C126385604","wikidata":"https://www.wikidata.org/wiki/Q1087609","display_name":"Chromatic polynomial","level":3,"score":0.5044606924057007},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.4710250794887543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4524180293083191},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4486980140209198},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.21742025017738342},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1416652798652649}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/6156","is_oa":true,"landing_page_url":"https://doi.org/10.37236/6156","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"}],"best_oa_location":{"id":"doi:10.37236/6156","is_oa":true,"landing_page_url":"https://doi.org/10.37236/6156","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/W4297911588","https://openalex.org/W2212115383","https://openalex.org/W2546620014","https://openalex.org/W4291316360","https://openalex.org/W2380525562","https://openalex.org/W2793500002","https://openalex.org/W2585997002","https://openalex.org/W1170108254","https://openalex.org/W4380300356","https://openalex.org/W2023633659"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"polynomial":[3],"ideal":[4],"theory":[5],"is":[6,43],"used":[7],"to":[8,35],"deal":[9],"with":[10],"the":[11,14,31,37,41],"problem":[12],"of":[13,17,28,40],"$S$-packing":[15,38],"coloring":[16],"a":[18,26],"finite":[19],"undirected":[20],"and":[21,45],"unweighted":[22],"graph":[23,42],"by":[24,47],"introducing":[25],"family":[27],"polynomials":[29],"encoding":[30],"problem.":[32],"A":[33],"method":[34],"find":[36],"colorings":[39],"presented":[44],"illustrated":[46],"examples.":[48]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}