{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:29:41Z","timestamp":1773376181037,"version":"3.50.1"},"reference-count":7,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":4874,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1993,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Star chromatic number, introduced by A. Vince, is a natural generalization of chromatic number. We consider the question, \u201cWhen is \u03c7* &lt; \u03c7?\u201d We show that \u03c7* &lt; \u03c7 if and only if a particular digraph is acyclic and that the decisioin problem associated with this question is probably not in NP though it is both NP\u2010hard and NP\u2010easy. \u00a9 1993 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190170202","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T23:17:55Z","timestamp":1181258275000},"page":"129-134","source":"Crossref","is-referenced-by-count":29,"title":["Acyclic graph coloring and the complexity of the star chromatic number"],"prefix":"10.1002","volume":"17","author":[{"given":"David R.","family":"Guichard","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Extremal Graph Theory","author":"Bollob\u00e1s B.","year":"1978"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190140412"},{"key":"e_1_2_1_4_2","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90016-X"},{"key":"e_1_2_1_6_2","unstructured":"E. W.Leggett Jr. Tools and Techniques for Classifying NP\u2010Hard Problems. Doctoral Thesis Department of Computer and Information Sciences Ohio State University (1977)."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190120411"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190160604"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190170202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190170202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T03:56:44Z","timestamp":1696910204000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190170202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["10.1002\/jgt.3190170202"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190170202","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}