{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T04:33:31Z","timestamp":1722486811735},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p> The celebrated Erd\u00f6s\u2013Faber\u2013Lov\u00e1sz conjecture originated in the year 1972. It can be stated as follows: any linear hypergraph on n vertices has chromatic index at most n. Different formulations of the conjecture have been obtained and the conjecture is proved to be true in some particular cases. But the problem is still unsolved in general. In this paper, we prove that the conjecture is true for all linear hypergraphs on n vertices with [Formula: see text]. It generalizes an existing result regarding an equivalent formulation of the conjecture for dense hypergraphs [A. Sanchez-Arroyo, The Erd\u00f6s\u2013Faber\u2013Lov\u00e1sz conjecture for dense hypergraphs, Discrete Math.308 (2008) 991\u2013992]. <\/jats:p>","DOI":"10.1142\/s1793830912500036","type":"journal-article","created":{"date-parts":[[2012,4,9]],"date-time":"2012-04-09T21:24:02Z","timestamp":1334006642000},"page":"1250003","source":"Crossref","is-referenced-by-count":7,"title":["ON EDGE COLORING OF HYPERGRAPHS AND ERD\u00d6S\u2013FABER\u2013LOV\u00c1SZ CONJECTURE"],"prefix":"10.1142","volume":"04","author":[{"given":"VIJI","family":"PAUL","sequence":"first","affiliation":[{"name":"Department of Mathematics, WMO Arts and Science College, Muttil, Kerala, India"}]},{"given":"K. A.","family":"GERMINA","sequence":"additional","affiliation":[{"name":"Research Centre &amp; PG Department of Mathematics, Mary Matha Arts and Science College, Vemom P.O., Mananthavady \u2013 670645, India"}]}],"member":"219","published-online":{"date-parts":[[2012,4,13]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126801"},{"key":"rf2","volume-title":"Introduction to Graph Theory","author":"Chartrand G.","year":"2005"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1155\/S0161171282000775"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579174"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.4310\/JOC.2010.v1.n2.a2"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1252"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1981-046-9"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.11.053"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(92)90096-D"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01204719"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/s00022-007-1960-5"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.09.026"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:53:35Z","timestamp":1565186015000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,13]]},"published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1142\/S1793830912500036"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500036","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}