{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:25:07Z","timestamp":1764174307193},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,27]],"date-time":"2016-08-27T00:00:00Z","timestamp":1472256000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0072-2","type":"journal-article","created":{"date-parts":[[2016,8,27]],"date-time":"2016-08-27T08:18:21Z","timestamp":1472285901000},"page":"174-181","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Note on incidence chromatic number of subquartic graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Petr","family":"Gregor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borut","family":"Lu\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Sot\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,27]]},"reference":[{"key":"72_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(89)90073-3","volume":"75","author":"I Algor","year":"1989","unstructured":"Algor I, Alon N (1989) The star arboricity of graphs. Discret Math 75:11\u201322","journal-title":"Discret Math"},{"issue":"1\u20133","key":"72_CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0012-365X(93)90286-3","volume":"122","author":"RA Brualdi","year":"1993","unstructured":"Brualdi RA, Massey JJQ (1993) Incidence and strong edge colorings of graphs. Discret Math 122(1\u20133):51\u201358","journal-title":"Discret Math"},{"key":"72_CR3","doi-asserted-by":"crossref","first-page":"R26","DOI":"10.37236\/1311","volume":"4","author":"WE Clark","year":"1997","unstructured":"Clark WE, Dunning LA (1997) Tight upper bounds for the domination numbers of graphs with given order and minimum degree. Electron J Combin 4:R26","journal-title":"Electron J Combin"},{"issue":"1\u20133","key":"72_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.disc.2004.01.015","volume":"283","author":"M Dolama","year":"2004","unstructured":"Dolama M, Sopena \u00c9, Zhu X (2004) Incidence coloring of $$k$$ k -degenerated graphs. Discret Math 283(1\u20133):121\u2013128","journal-title":"Discret Math"},{"key":"72_CR5","first-page":"33","volume":"125","author":"H Fahimi","year":"2016","unstructured":"Fahimi H, Omoomi B (2016) On incidence coloring of some graphs of maximum degree 4. Ars Combin 125:33\u201345","journal-title":"Ars Combin"},{"key":"72_CR6","doi-asserted-by":"publisher","unstructured":"Gregor P, Lu\u017ear B, Sot\u00e1k R (2016) On incidence coloring conjecture in Cartesian products of graphs. Discret Appl Math. doi: 10.1016\/j.dam.2016.04.030","DOI":"10.1016\/j.dam.2016.04.030"},{"issue":"1\u20133","key":"72_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0012-365X(95)00342-T","volume":"163","author":"B Guiduli","year":"1997","unstructured":"Guiduli B (1997) On incidence coloring and star arboricity of graphs. Discret Math 163(1\u20133):275\u2013278","journal-title":"Discret Math"},{"issue":"1","key":"72_CR8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall P (1935) On representatives of subsets. J Lond Math Soc 10(1):26\u201330","journal-title":"J Lond Math Soc"},{"issue":"1\u20133","key":"72_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.disc.2005.02.003","volume":"292","author":"M Maydanskiy","year":"2005","unstructured":"Maydanskiy M (2005) The incidence coloring conjecture for graphs of maximum degree 3. Discret Math 292(1\u20133):131\u2013141","journal-title":"Discret Math"},{"issue":"10","key":"72_CR10","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.ipl.2015.05.002","volume":"115","author":"AC Shiau","year":"2015","unstructured":"Shiau AC, Shiau TH, Wang YL (2015) Incidence coloring of Cartesian product graphs. Inf Process Lett 115(10):765\u2013768","journal-title":"Inf Process Lett"},{"key":"72_CR11","unstructured":"Sopena, \u00c9 (2015) The incidence coloring page. http:\/\/www.labri.fr\/perso\/sopena\/pmwiki\/index.php?n=TheIncidenceColoringPage . Accessed 28 Dec 2015"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0072-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0072-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0072-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0072-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T04:50:25Z","timestamp":1657169425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0072-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,27]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0072-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,27]]}}}