{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:45:28Z","timestamp":1760150728285,"version":"build-2065373602"},"reference-count":14,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2020J05058"],"award-info":[{"award-number":["2020J05058"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds for the Central Universities of Huaqiao University","award":["ZQN-903"],"award-info":[{"award-number":["ZQN-903"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>Let G be a graph with a minimum degree \u03b4 of at least two. The inclusion chromatic index of G, denoted by \u03c7\u2282\u2032(G), is the minimum number of colors needed to properly color the edges of G so that the set of colors incident with any vertex is not contained in the set of colors incident to any of its neighbors. We prove that every connected subcubic graph G with \u03b4(G)\u22652 either has an inclusion chromatic index of at most six, or G is isomorphic to K^2,3, where its inclusion chromatic index is seven.<\/jats:p>","DOI":"10.3390\/axioms11010033","type":"journal-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T08:20:42Z","timestamp":1642407642000},"page":"33","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3487-4967","authenticated-orcid":false,"given":"Lily","family":"Chen","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Huaqiao University, Quanzhou 362000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2452-9713","authenticated-orcid":false,"given":"Yanyi","family":"Li","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Huaqiao University, Quanzhou 362000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.parco.2012.07.001","article-title":"Graph coloring algorithms for multi-core and massively multithreaded architectures","volume":"38","author":"Feo","year":"2012","journal-title":"Parallel Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1111\/j.1749-6632.1979.tb32771.x","article-title":"Enumeration of stable stereo and position isomers of polysubstituted alcohols","volume":"319","author":"Balasubramanian","year":"1979","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"ref_3","first-page":"1","article-title":"Computations of colorings 7D-Hypercube\u2019s hyperplanes for all irreducible representations","volume":"9999","author":"Balasubramanian","year":"2019","journal-title":"J. Comput. Chem."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/jcc.540060513","article-title":"Computer generation of King and Color Polynomials of graphs and lattices and their applications to statistical mechanics","volume":"6","author":"Balasubramanian","year":"1985","journal-title":"J. Comput. Chem."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Beckenbach, E.F. (1964). Applied Combinatorial Mathematics, Wiley.","DOI":"10.2307\/2987401"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1063\/1.523411","article-title":"King and domino polynomials for polyomino graphs","volume":"18","author":"Motoyama","year":"1977","journal-title":"J. Math. Phys."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1002\/jcc.540060207","article-title":"Computer Generation of Matching Polynimials of Chemical Graphs and Lattices","volume":"6","author":"Ramaraj","year":"1985","journal-title":"J. Comput. Chem."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1116\/1.1318447","article-title":"Adsorption of Simple Particles onto a One Dimensional Lattice with Nearest Neighbor Interaction","volume":"10","author":"McQuistan","year":"1973","journal-title":"J. Vac. Sci. Technol."},{"key":"ref_9","first-page":"5","article-title":"On the inclusion chromatic index of a graph","volume":"97","year":"2020","journal-title":"J. Graph Theory"},{"key":"ref_10","first-page":"1","article-title":"The Smarandachely adjacent vertex edge coloring of graphs","volume":"3","author":"Zhang","year":"2008","journal-title":"Sci. Rep. Lanzhou Jiaotong Univ."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00373-020-02246-w","article-title":"Strict neighbor-distinguishing index of subcubic graphs","volume":"37","author":"Gu","year":"2021","journal-title":"Graphs Combin."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","article-title":"Adjacent strong edge coloring of graphs","volume":"15","author":"Zhang","year":"2002","journal-title":"Appl. Math. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/S0895480102414107","article-title":"Adjacent vertex distinguishing edge-colorings","volume":"21","author":"Balister","year":"2007","journal-title":"SIAM J. Discret. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.jctb.2005.04.002","article-title":"\u0394 + 300 is a bound on the adjacent vertex distinguishing edge chromatic number","volume":"95","author":"Hatami","year":"2005","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/11\/1\/33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:02:17Z","timestamp":1760133737000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/11\/1\/33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":14,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,1]]}},"alternative-id":["axioms11010033"],"URL":"https:\/\/doi.org\/10.3390\/axioms11010033","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2022,1,17]]}}}