{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T11:51:19Z","timestamp":1768477879381,"version":"3.49.0"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100001809","name":"national natural sciences foundation of China","doi-asserted-by":"crossref","award":["11571294"],"award-info":[{"award-number":["11571294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p> A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path. The conflict-free vertex-connection number, denoted by [Formula: see text], is defined as the smallest number of colors required to make [Formula: see text] conflict-free vertex-connected. Li et al. [Conflict-free vertex-connections of graphs, preprint (2017), arXiv:1705.07270v1[math.CO]] conjectured that for a connected graph [Formula: see text] of order [Formula: see text], [Formula: see text]. We confirm that the conjecture is true and poses two relevant conjectures. <\/jats:p>","DOI":"10.1142\/s1793830918500593","type":"journal-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T04:29:22Z","timestamp":1530073762000},"page":"1850059","source":"Crossref","is-referenced-by-count":8,"title":["Maximum value of conflict-free vertex-connection number of graphs"],"prefix":"10.1142","volume":"10","author":[{"given":"Zhenzhen","family":"Li","sequence":"first","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,10,11]]},"reference":[{"key":"S1793830918500593BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830918500593BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/120880471"},{"key":"S1793830918500593BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.03.005"},{"key":"S1793830918500593BIB006","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2036"},{"key":"S1793830918500593BIB008","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702431840"},{"key":"S1793830918500593BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90194-9"},{"key":"S1793830918500593BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)E0216-Q"},{"key":"S1793830918500593BIB013","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990290"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830918500593","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:39:29Z","timestamp":1565181569000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830918500593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":8,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2018,10,11]]},"published-print":{"date-parts":[[2018,10]]}},"alternative-id":["10.1142\/S1793830918500593"],"URL":"https:\/\/doi.org\/10.1142\/s1793830918500593","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}