{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:38:37Z","timestamp":1740155917014,"version":"3.37.3"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,2]]},"abstract":"<jats:p> We provide upper bounds on the chromatic number of the square of graphs, which have vertex ordering characterizations. We prove that [Formula: see text] is [Formula: see text]-colorable when [Formula: see text] is a cocomparability graph, [Formula: see text]-colorable when [Formula: see text] is a strongly orderable graph and [Formula: see text]-colorable when [Formula: see text] is a dually chordal graph, where [Formula: see text] is the maximum degree and [Formula: see text] = max[Formula: see text] is the multiplicity of the graph [Formula: see text]. This improves the currently known upper bounds on the chromatic number of squares of graphs from these classes. <\/jats:p>","DOI":"10.1142\/s1793830920500937","type":"journal-article","created":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T01:57:33Z","timestamp":1595037453000},"page":"2050093","source":"Crossref","is-referenced-by-count":0,"title":["Coloring squares of graphs via vertex orderings"],"prefix":"10.1142","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3482-5137","authenticated-orcid":false,"given":"Mehmet Akif","family":"Yetim","sequence":"first","affiliation":[{"name":"Department of Mathematics, Suleyman Demirel University, Isparta 32260, Turkey"}]}],"member":"219","published-online":{"date-parts":[[2020,8,21]]},"reference":[{"issue":"1","key":"S1793830920500937BIB001","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(97)00125-X","volume":"82","author":"Brandstdt A.","year":"1998","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"S1793830920500937BIB002","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/net.20257","volume":"53","author":"Calamoneri T.","year":"2009","journal-title":"Networks"},{"issue":"7","key":"S1793830920500937BIB003","doi-asserted-by":"crossref","first-page":"1894","DOI":"10.1016\/j.disc.2019.03.011","volume":"342","author":"Civan Y.","year":"2019","journal-title":"Discrete Math."},{"volume-title":"Generalized Strongly Chordal Graphs","year":"2003","author":"Dahlhaus E.","key":"S1793830920500937BIB004"},{"issue":"1","key":"S1793830920500937BIB005","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0166-218X(99)00149-3","volume":"99","author":"Dragan F. F.","year":"2000","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"S1793830920500937BIB007","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"Hale W. K.","year":"1980","journal-title":"Proc. IEEE"},{"issue":"3","key":"S1793830920500937BIB009","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"Kratsch D.","year":"1993","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"S1793830920500937BIB010","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0012-365X(03)00059-1","volume":"269","author":"Lih K. W.","year":"2003","journal-title":"Discrete Math."},{"issue":"13","key":"S1793830920500937BIB011","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.ipl.2012.04.003","volume":"112","author":"Panda B. S.","year":"2012","journal-title":"Inform. Process. Lett."},{"key":"S1793830920500937BIB013","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.jctb.2017.08.010","volume":"128","author":"Thomassen C.","year":"2018","journal-title":"J. Combin. Theory B"},{"key":"S1793830920500937BIB015","unstructured":"D. B. West ,  Introduction to Graph Theory  (Prentice Hall,  Upper Saddle River, New Jersey,  2001),  470 p."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T10:58:46Z","timestamp":1611053926000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,21]]},"references-count":11,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["10.1142\/S1793830920500937"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500937","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2020,8,21]]}}}