{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:10:14Z","timestamp":1753881014176,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["09\/1108(0016)\/2017-EMR-1"],"award-info":[{"award-number":["09\/1108(0016)\/2017-EMR-1"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:p> Let [Formula: see text] be a simple, connected graph of order [Formula: see text] and size [Formula: see text] Then, [Formula: see text] is said to be edge [Formula: see text]-choosable, if there exists a collection of subsets of the edge set, [Formula: see text] of cardinality [Formula: see text] such that [Formula: see text] whenever [Formula: see text] and [Formula: see text] are incident. This paper initiates a study on edge [Formula: see text]-choosability of certain fundamental classes of graphs and determines the maximum value of [Formula: see text] for which the given graph [Formula: see text] is edge [Formula: see text]-choosable. Also, in this paper, the relation between edge choice number and other graph theoretic parameters is discussed and we have given a conjecture on the relation between edge choice number and matching number of a graph. <\/jats:p>","DOI":"10.1142\/s1793830922500252","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T04:49:58Z","timestamp":1635396598000},"source":"Crossref","is-referenced-by-count":1,"title":["Edge (m,k)-choosability of graphs"],"prefix":"10.1142","volume":"14","author":[{"given":"P.","family":"Soorya","sequence":"first","affiliation":[{"name":"Department of Mathematics, Central University of Kerala, Kasaragod 671316, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. A.","family":"Germina","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Central University of Kerala, Kasaragod 671316, Kerala, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"S1793830922500252BIB001","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000122"},{"key":"S1793830922500252BIB002","first-page":"5","volume":"11","author":"Erd\u00f6s P.","year":"1963","journal-title":"Nordisk. Mat. Tidskrift"},{"key":"S1793830922500252BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(77)90039-9"},{"key":"S1793830922500252BIB004","series-title":"Congressus Numerantium","first-page":"125","volume-title":"Proc. West Coast Conf. Combinatorics, Graph Theory and Computing","volume":"26","author":"Erd\u00f6s P.","year":"1979"},{"key":"S1793830922500252BIB005","first-page":"905","volume":"43","author":"Germina K. A.","year":"2020","journal-title":"Italian J. Pure Appl. Math."},{"key":"S1793830922500252BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.04.061"},{"volume-title":"Graph Theory","year":"2001","author":"Harary F.","key":"S1793830922500252BIB007"},{"key":"S1793830922500252BIB008","first-page":"4140","volume":"9","author":"Soorya P.","year":"2020","journal-title":"Int. J. Sci. Technol. Res."},{"key":"S1793830922500252BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s40009-020-01006-x"},{"key":"S1793830922500252BIB010","first-page":"3","volume":"29","author":"Vizing V. G.","year":"1976","journal-title":"Metody Diskretnogo Analiza"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T03:46:51Z","timestamp":1665805611000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,27]]},"references-count":10,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["10.1142\/S1793830922500252"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500252","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,10,27]]},"article-number":"2250025"}}