{"id":"https://openalex.org/W2974530346","doi":"https://doi.org/10.1142/s1793830919500666","title":"Linear time algorithm for dominator chromatic number of trestled graphs","display_name":"Linear time algorithm for dominator chromatic number of trestled graphs","publication_year":2019,"publication_date":"2019-09-18","ids":{"openalex":"https://openalex.org/W2974530346","doi":"https://doi.org/10.1142/s1793830919500666","mag":"2974530346"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830919500666","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500666","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/A5043658441","display_name":"S. Arumugam","orcid":"https://orcid.org/0000-0002-4477-9453"},"institutions":[{"id":"https://openalex.org/I98499257","display_name":"Kalasalingam Academy of Research and Education","ror":"https://ror.org/04fm2fn75","country_code":"IN","type":"education","lineage":["https://openalex.org/I98499257"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"S. Arumugam","raw_affiliation_strings":["National Centre for Advanced Research in Discrete Mathematics (-CARDMATH), Kalasalingam Academy of Research and Education, Anand Nagar, Krishnankoil 626126, Tamil Nadu, India"],"raw_orcid":"https://orcid.org/0000-0002-4477-9453","affiliations":[{"raw_affiliation_string":"National Centre for Advanced Research in Discrete Mathematics (-CARDMATH), Kalasalingam Academy of Research and Education, Anand Nagar, Krishnankoil 626126, Tamil Nadu, India","institution_ids":["https://openalex.org/I98499257"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064923800","display_name":"Kameshwar Chandrasekar","orcid":"https://orcid.org/0000-0002-6249-5593"},"institutions":[{"id":"https://openalex.org/I81556334","display_name":"Amrita Vishwa Vidyapeetham","ror":"https://ror.org/03am10p12","country_code":"IN","type":"education","lineage":["https://openalex.org/I81556334"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Raja Chandrasekar","raw_affiliation_strings":["Department of Mathematics, Amrita College of Engineering and Technology, Amritagiri, Erachakulam Post, Nagercoil 629902, Tamil Nadu, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Amrita College of Engineering and Technology, Amritagiri, Erachakulam Post, Nagercoil 629902, Tamil Nadu, India","institution_ids":["https://openalex.org/I81556334"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043658441"],"corresponding_institution_ids":["https://openalex.org/I98499257"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1506738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"06","first_page":"1950066","last_page":"1950066"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9919999837875366,"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.9865000247955322,"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/mathematics","display_name":"Mathematics","score":0.8304973840713501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7791280746459961},{"id":"https://openalex.org/keywords/chromatic-scale","display_name":"Chromatic scale","score":0.7026623487472534},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.6674457788467407},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.6605032682418823},{"id":"https://openalex.org/keywords/brooks-theorem","display_name":"Brooks' theorem","score":0.645176887512207},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge coloring","score":0.5788285732269287},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.5668305158615112},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.5545147657394409},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5043727159500122},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44027090072631836},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.4395020604133606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.425495445728302},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.15338867902755737},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.09412315487861633},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.09054148197174072}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8304973840713501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7791280746459961},{"id":"https://openalex.org/C196956537","wikidata":"https://www.wikidata.org/wiki/Q202021","display_name":"Chromatic scale","level":2,"score":0.7026623487472534},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.6674457788467407},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.6605032682418823},{"id":"https://openalex.org/C51658606","wikidata":"https://www.wikidata.org/wiki/Q512897","display_name":"Brooks' theorem","level":5,"score":0.645176887512207},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.5788285732269287},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.5668305158615112},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.5545147657394409},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5043727159500122},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44027090072631836},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4395020604133606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.425495445728302},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.15338867902755737},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.09412315487861633},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.09054148197174072},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830919500666","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500666","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":[{"display_name":"Sustainable cities and communities","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1809657861","https://openalex.org/W1863257697","https://openalex.org/W1988737472","https://openalex.org/W2015832089","https://openalex.org/W2019046824","https://openalex.org/W2065836304","https://openalex.org/W2068334720","https://openalex.org/W2080357955","https://openalex.org/W2143398735","https://openalex.org/W2343061998","https://openalex.org/W2559295975"],"related_works":["https://openalex.org/W4311345810","https://openalex.org/W4297911588","https://openalex.org/W2585997002","https://openalex.org/W3169197204","https://openalex.org/W3157287446","https://openalex.org/W4212987857","https://openalex.org/W4296943582","https://openalex.org/W2175082514","https://openalex.org/W151506147","https://openalex.org/W1542397451"],"abstract_inverted_index":{"A":[0],"dominator":[1,5,55,59,68,73,98,104],"coloring":[2,16,56,99,105],"(respectively,":[3,29,57,71,87],"total":[4,58,72,103],"coloring)":[6,60],"of":[7,20,32,35,43,50,61,76],"a":[8,14,40,54],"graph":[9],"[Formula:":[10,17,21,36,44,62,77,84,88],"see":[11,18,22,37,45,63,78,85,89],"text]":[12,19,23,38,46,64,79,86],"is":[13,65,81],"proper":[15],"such":[24],"that":[25,96],"each":[26],"closed":[27],"neighborhood":[28],"open":[30],"neighborhood)":[31],"every":[33],"vertex":[34],"contains":[39],"color":[41],"class":[42],"The":[47],"minimum":[48],"number":[49,70],"colors":[51],"required":[52],"for":[53,112],"called":[66],"the":[67,97,102],"chromatic":[69,74],"number)":[75],"and":[80,101],"denoted":[82],"by":[83],"text]).":[90],"In":[91],"this":[92],"paper,":[93],"we":[94],"prove":[95],"problem":[100,106],"are":[107],"solvable":[108],"in":[109],"linear":[110],"time":[111],"trestled":[113],"graphs.":[114]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}