{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:29:31Z","timestamp":1753885771006,"version":"3.41.2"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:p> For a graph [Formula: see text], an edge connectivity [Formula: see text] is the minimum number of edges whose removal disconnects G. In this paper, we define property restricted edge connectivity. Then we appraise its particular case, more precisely k-restricted edge connectivity. Some of the basic properties of k-restricted edge connectivity are considered. We also discuss how k-restricted edge connectivity associates with graph coloring. In particular, we try to study how k-restricted edge connectivity relates with Tait\u2019s coloring theorem and thereby the famous Four-color conjecture. <\/jats:p>","DOI":"10.1142\/s1793830922500896","type":"journal-article","created":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T13:40:47Z","timestamp":1651239647000},"source":"Crossref","is-referenced-by-count":1,"title":["An extended study of <i>k<\/i>-restricted edge connectivity: Another approach to Tait\u2019s coloring theorem"],"prefix":"10.1142","volume":"15","author":[{"given":"G","family":"Suresh Singh","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Kerala, Kariavattom, Thiruvananthapuram, Kerala, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1363-4275","authenticated-orcid":false,"given":"Athira","family":"Chandran","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Kerala, Kariavattom, Thiruvananthapuram, Kerala, India"}]}],"member":"219","published-online":{"date-parts":[[2022,4,27]]},"reference":[{"volume-title":"Graph Theory","year":"2010","author":"Suresh Singh G.","key":"S1793830922500896BIB001"},{"key":"S1793830922500896BIB002","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"Bondy J. A.","year":"2008"},{"key":"S1793830922500896BIB003","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0012-365X(01)00232-1","volume":"243","author":"Xu Jun-Ming","year":"2002","journal-title":"Discrete Math."},{"key":"S1793830922500896BIB004","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.disc.2005.04.020","volume":"304","author":"Zhang Zhao","year":"2005","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T10:15:12Z","timestamp":1679652912000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,27]]},"references-count":4,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10.1142\/S1793830922500896"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500896","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,4,27]]},"article-number":"2250089"}}