[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_919b13d1-a08f-4fd0-8013-9cf0fadefb15":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:919b13d1-a08f-4fd0-8013-9cf0fadefb15,\"}":793},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":671,"manageAffiliations":688,"indexDatabases":710,"url":26,"thumbnailPath":26,"statistic":750,"gsStatistic":26,"type":26,"analyzePriority":26},"919b13d1-a08f-4fd0-8013-9cf0fadefb15","2024-04-12T00:29:27.546+00:00","2025-11-21T10:01:06.467+00:00",[],"Springer-Science-and-Business-Media-LLC",{"issn":665,"eissn":667,"title":669},{"VOID":666},"0911-0119",{"VOID":668},"1435-5914",{"EN":670},"Springer Science and Business Media LLC",[672,680],{"id":673,"createTime":674,"updateTime":675,"relativeEntities":676,"label":677,"description":679,"parentId":26,"standard":26,"scholarHubFieldId":26},"a06329a6-a71d-47d7-8746-ea6ef7265d66","2023-05-29T10:24:29.758+00:00","2023-11-21T05:15:17.282+00:00",[],{"EN":678},"Discrete Mathematics and Combinatorics",{},{"id":681,"createTime":682,"updateTime":683,"relativeEntities":684,"label":685,"description":687,"parentId":26,"standard":26,"scholarHubFieldId":26},"cfe20487-5108-4c23-a284-2aedca5fb76d","2023-05-29T10:24:09.965+00:00","2023-11-21T05:15:17.277+00:00",[],{"EN":686},"Theoretical Computer Science",{},[689,700],{"id":690,"createTime":691,"updateTime":692,"relativeEntities":693,"slug":694,"properties":695,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":135,"url":26,"parentIds":698,"statistic":26},"097ed5ab-2745-4d28-a6f8-9cef8109dee5","2023-05-29T10:24:42.580+00:00","2025-06-11T22:26:19.069+00:00",[],"Springer-Japan",{"title":696},{"EN":697},"Springer Japan",[699],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":701,"createTime":702,"updateTime":703,"relativeEntities":704,"slug":705,"properties":706,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":158,"url":26,"parentIds":709,"statistic":26},"703e6040-17b1-4447-a4fc-241fbd0f3879","2023-05-29T12:10:46.581+00:00","2023-12-20T07:50:15.296+00:00",[],"SPRINGER-JAPAN-KK",{"title":707},{"EN":708},"SPRINGER JAPAN KK",[699],[711,731],{"id":712,"indexDatabase":713,"url":725,"indexYears":726,"academicFieldIds":727,"indexDatabaseRanking":730},"e6667b84-f42b-4230-8d52-6a5e6f4b8009",{"id":714,"createTime":715,"updateTime":716,"relativeEntities":717,"label":718,"description":720,"key":722,"publicationTags":723,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":719,"VI":719},"Scopus - Elsevier",{"EN":719,"VI":721},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[724],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F28476","1985-2025",[728,729],"8f050cfc-6be8-4218-91ba-e890405f0438","53359a50-9d5f-403b-bba4-5596d4193bbc","SCOPUS__Q2",{"id":732,"indexDatabase":733,"url":747,"indexYears":26,"academicFieldIds":748,"indexDatabaseRanking":26},"50da55f3-b187-45ea-9fb5-2118abbcb21d",{"id":734,"createTime":735,"updateTime":736,"relativeEntities":737,"label":738,"description":740,"key":743,"publicationTags":744,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":739,"VI":739},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":741,"EN":742},"Cơ sở dữ liệu SCIE","SCIE database","scie",[745,746],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0911-0119",[749],"a410dee4-fcd0-43bf-ac42-c2f733ee737f",{"impactFactor":36,"impactFactorByYear":751,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":753,"totalCitation":757,"totalCitationByYear":758,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":768,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},1988,{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},87,90,82,3024,{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},172,155,364,62,98,85,122,163,1.52,{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},2.73,0.82,5.04,3.53,4.53,4.96,1.57,1.62,6.46,1.82,2.89,1.79,3.16,0.8,2.63,10.4,1.94,1.88,1.25,0.84,1.91,1.23,1.72,0.34,{"meta":794,"data":796},{"total":795},"1991",[797,878,1162,1652,1726,1902,2791,2983,3099,3244],{"id":798,"createTime":799,"updateTime":800,"relativeEntities":801,"slug":802,"properties":803,"entityType":814,"verifyStatus":25,"verifyTime":800,"verifyNote":815,"syncStatus":28,"languages":816,"translateLanguages":26,"viewCount":36,"primaryUrl":817,"fullTextUrl":26,"authors":818,"publicationType":839,"publisherRelationship":840,"citationCount":869,"citationInfo":870,"publishDate":872,"publishYear":873,"citationAnalyzeStatus":874,"lastCitationAnalyze":875,"indexDatabases":26,"openAccess":26,"references":876,"isForceReanalyzing":877},"2de26920-9eb4-4742-9521-51be330d8087","2024-04-14T04:15:53.147+00:00","2025-01-04T08:26:49.371+00:00",[],"Advances-on-the-Hamiltonian-Problem-A-Survey",{"mag":804,"keywords":806,"openalex":807,"abstract":809,"title":810,"doi":812},{"VOID":805},"2110444610",{},{"VOID":808},"W2110444610",{},{"EN":811},"Advances on the Hamiltonian Problem - A Survey",{"VOID":813},"10.1007\u002Fs00373-002-0492-x","PUBLICATION","Auto Verify",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00373-002-0492-x",[819],{"id":820,"sortIndex":36,"researcher":26,"roles":821,"affiliations":822,"properties":832},"73f3e238-ae62-4194-94c5-4f38be1d9e3f",[],[823],{"id":26,"sortIndex":36,"affiliation":824,"properties":26},{"id":825,"createTime":826,"updateTime":826,"relativeEntities":827,"slug":828,"properties":829,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"e2f00cd6-01bf-4ef4-815b-eb88a90429b9","2024-04-14T04:15:53.157+00:00",[],"Emory-University-Atlanta-GA-30322-USA-US",{"title":830},{"EN":831},"Emory University, Atlanta, GA 30322, USA, , US",{"openalex":833,"orcid":835,"title":837},{"VOID":834},"A5077689134",{"VOID":836},"https:\u002F\u002Forcid.org\u002F0000-0003-0040-9511",{"EN":838},"Ronald J. Gould","ARTICLE",{"url":26,"publisher":841,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":842,"slug":663,"properties":843,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":847,"manageAffiliations":848,"indexDatabases":849,"url":26,"thumbnailPath":26,"statistic":864,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":844,"eissn":845,"title":846},{"VOID":666},{"VOID":668},{"EN":670},[],[],[850,857],{"id":712,"indexDatabase":851,"url":725,"indexYears":726,"academicFieldIds":856,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":852,"label":853,"description":854,"key":722,"publicationTags":855,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":858,"url":747,"indexYears":26,"academicFieldIds":863,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":859,"label":860,"description":861,"key":743,"publicationTags":862,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":865,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":866,"totalCitation":757,"totalCitationByYear":867,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":868,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},191,{"total":869,"publishYear":26,"statisticByYear":871},{"2012":52,"2013":53,"2014":53,"2015":158,"2016":116,"2017":53,"2018":50,"2019":135,"2020":116,"2021":298,"2022":116,"2023":111},"2003-03-01",2003,"ERROR_IN_ANALYZE_CITATION","2024-04-14T15:09:54.007+00:00",[],false,{"id":879,"createTime":880,"updateTime":881,"relativeEntities":882,"slug":883,"properties":884,"entityType":814,"verifyStatus":25,"verifyTime":881,"verifyNote":815,"syncStatus":28,"languages":895,"translateLanguages":26,"viewCount":36,"primaryUrl":896,"fullTextUrl":26,"authors":897,"publicationType":839,"publisherRelationship":920,"citationCount":956,"citationInfo":957,"publishDate":959,"publishYear":960,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":961,"isForceReanalyzing":877},"a0bad74c-2437-484f-9d0f-3b26020c7366","2024-04-16T22:12:47.464+00:00","2025-01-17T10:05:21.861+00:00",[],"What-we-know-and-what-we-do-not-know-about-Tur%C3%A1n-numbers",{"mag":885,"keywords":887,"openalex":888,"abstract":890,"title":891,"doi":893},{"VOID":886},"2004751842",{},{"VOID":889},"W2004751842",{},{"EN":892},"What we know and what we do not know about Turán numbers",{"VOID":894},"10.1007\u002Fbf01929486",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01929486",[898],{"id":899,"sortIndex":36,"researcher":26,"roles":900,"affiliations":901,"properties":913},"aaa77eed-3f44-4a8e-a856-c9cf6ea37506",[],[902],{"id":903,"sortIndex":36,"affiliation":904,"properties":26},"1e8a7380-29e7-4147-9c2d-98e4f4b7830e",{"id":905,"createTime":906,"updateTime":907,"relativeEntities":908,"slug":909,"properties":910,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"ff15967a-e8b7-4126-abdd-fd6d69ef6d74","2023-12-09T14:09:40.769+00:00","2024-11-29T17:45:36.562+00:00",[],"Courant-Institute-of-Mathematical-Sciences-New-York-University-New-York-USA",{"title":911},{"VI":912},"Courant Institute of Mathematical Sciences, New York University, New York, USA",{"openalex":914,"orcid":916,"title":918},{"VOID":915},"A5058637996",{"VOID":917},"https:\u002F\u002Forcid.org\u002F0000-0002-1755-4013",{"EN":919},"Alexander Sidorenko",{"url":26,"publisher":921,"properties":949},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":922,"slug":663,"properties":923,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":927,"manageAffiliations":928,"indexDatabases":929,"url":26,"thumbnailPath":26,"statistic":944,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":924,"eissn":925,"title":926},{"VOID":666},{"VOID":668},{"EN":670},[],[],[930,937],{"id":712,"indexDatabase":931,"url":725,"indexYears":726,"academicFieldIds":936,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":932,"label":933,"description":934,"key":722,"publicationTags":935,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":938,"url":747,"indexYears":26,"academicFieldIds":943,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":939,"label":940,"description":941,"key":743,"publicationTags":942,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":945,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":946,"totalCitation":757,"totalCitationByYear":947,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":948,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"volume":950,"pages":952,"issue":954},{"VOID":951},"11",{"VOID":953},"179-199",{"VOID":955},"2",141,{"total":956,"publishYear":26,"statisticByYear":958},{"2012":162,"2013":158,"2014":135,"2015":50,"2016":59,"2017":111,"2018":162,"2019":116,"2020":516,"2021":124,"2022":50,"2023":135,"2024":115},"1995-06-01",1995,[962,965,969,972,976,979,983,986,989,993,997,1001,1005,1009,1012,1015,1019,1022,1026,1029,1033,1037,1040,1044,1048,1052,1055,1059,1063,1066,1069,1072,1076,1080,1083,1086,1089,1092,1096,1100,1103,1106,1109,1112,1115,1119,1123,1127,1130,1133,1136,1140,1143,1146,1149,1153,1156,1159],{"id":26,"text":963,"url":26,"identifiers":964},"Boyer, E.D., Kreher, D.L., Radziszowski, S.P., Zou, J., and Sidorenko, A.: On (n, 5, 3)-Turán systems. Ars Combinatoria37, 1–19 (1994)",{},{"id":26,"text":966,"url":26,"identifiers":967},"Brown, W.G.: On an open problem of Paul Turán concerning 3-graphs. In: Studies in pure mathematics, pp. 91–93. Basel-Boston, Mass.: Birkhäuser 1983",{"doi":968},"10.1007\u002F978-3-0348-5438-2_9",{"id":26,"text":970,"url":26,"identifiers":971},"Caen, D. de: Extension of a theorem of Moon and Moser on complete subgraphs. Ars Combinatoria16, 5–10 (1983)",{},{"id":26,"text":973,"url":26,"identifiers":974},"Caen, D. de: A note on the probabilistic approach to Turán's problem. J. Comb. TheoryB 34, 340–349 (1983)",{"doi":975},"10.1016\u002F0095-8956(83)90045-X",{"id":26,"text":977,"url":26,"identifiers":978},"Caen, D. de: The current status of Turán's problem on hypergraphs. In: Extremal Problems for Finite Sets, Visegrád (Hungary), 1991, Bolyai Society Mathematical Studies, Vol. 3, pp. 187–197",{},{"id":26,"text":980,"url":26,"identifiers":981},"Caen, D. de, Kreher, D.L., Radziszowski, S.P., and Mills, W.H.: On the coverings oft-sets with (t + 1)-sets:C(9, 5, 4) andC(10, 6, 5). Discrete Mathematics92, 65–77 (1991)",{"doi":982},"10.1016\u002F0012-365X(91)90267-6",{"id":26,"text":984,"url":26,"identifiers":985},"Caen, D. de, Kreher, D.L., and Wiseman, J.: On constructive upper bounds for the Turán numbersT(n, 2r + 1, r). Congressus Numerantium65, 277–280 (1988)",{},{"id":26,"text":987,"url":26,"identifiers":988},"Droesbeke, F., Lorea, M.: Détermination de valeurs du nombre de TuránT(n, 4, 6). Cahiers du Cent. Étud. Rech. Oper.24, 185–191 (1982)",{},{"id":26,"text":990,"url":26,"identifiers":991},"Erdos, P.: On the combinatorial problems I would most like to see solved. Combinatorica1, 25–42 (1981)",{"doi":992},"10.1007\u002FBF02579174",{"id":26,"text":994,"url":26,"identifiers":995},"Fon-Der-Flaass, D.G.: A method for constructing (3,4)-graphs. Math. Notes44, (1988)",{"doi":996},"10.1007\u002FBF01158925",{"id":26,"text":998,"url":26,"identifiers":999},"Fort, M.K., Hedlund, G.A.: Minimal coverings of pairs by triples. Pacific J of Mathematics8, 709–719 (1958)",{"doi":1000},"10.2140\u002Fpjm.1958.8.709",{"id":26,"text":1002,"url":26,"identifiers":1003},"Frankl, P., Rödl, V.: Lower bounds for Turán's problem. Graphs and Combinatorics1, 213–216 (1985)",{"doi":1004},"10.1007\u002FBF02582949",{"id":26,"text":1006,"url":26,"identifiers":1007},"Füredi, Z.: Covering pairs byq 2 +q + 1 sets. J. Comb. TheoryA 54, 248–271 (1990)",{"doi":1008},"10.1016\u002F0097-3165(90)90034-T",{"id":26,"text":1010,"url":26,"identifiers":1011},"Gardner, B.: Results on coverings of pairs with special reference to coverings by quintuples. Congressus Numerantium23, 169–178 (1971)",{},{"id":26,"text":1013,"url":26,"identifiers":1014},"Giraud, G.: Majoration du nombre de Ramsey ternaires-bicolore en (4,4). C. R. Acad. Sci. ParisAB269, A620-A622 (1969)",{},{"id":26,"text":1016,"url":26,"identifiers":1017},"Giraud, G.: Remarques sur deus problèmes estrémaux. Discrete Mathematics84, 319–321 (1990)",{"doi":1018},"10.1016\u002F0012-365X(90)90138-8",{"id":26,"text":1020,"url":26,"identifiers":1021},"Giraud, G.: Une minoration de la premiere fonction ternaire de Turán, manuscript",{},{"id":26,"text":1023,"url":26,"identifiers":1024},"Gordon, D.M., Kuperberg, G., and Patashnik, O.: New constructions for covering designs. J. Comb. Design, to be published",{"doi":1025},"10.1002\u002Fjcd.3180030404",{"id":26,"text":1027,"url":26,"identifiers":1028},"Katona, G., Nemetz, T., and Simonovits, M.: On a graph problem of Turán, (in Hungarian). Mat. Lapok15, 228–238 (1964)",{},{"id":26,"text":1030,"url":26,"identifiers":1031},"Kim, K.H., Roush, F.W.: On a problem of Turán. In: Studies in pure mathematics, pp. 423–425. Basel-Boston, Mass.: Birkhäuser 1983",{"doi":1032},"10.1007\u002F978-3-0348-5438-2_37",{"id":26,"text":1034,"url":26,"identifiers":1035},"Kostochka, A.V.: A class of constructions for Turán's (3,4)-problem. Combinatorica2, 187–192 (1982)",{"doi":1036},"10.1007\u002FBF02579317",{"id":26,"text":1038,"url":26,"identifiers":1039},"Kuzyurin, N.N.: Asymptotic investigation of the covering problem. Cybernetic Problems37, 19–56 (1980)",{},{"id":26,"text":1041,"url":26,"identifiers":1042},"Feng-Chu Lai, Chang, G.J.: An upper bound for the transversal numbers of 4-uniform hypergraphs. J. Comb. TheoryB 50, 129–133 (1990)",{"doi":1043},"10.1016\u002F0095-8956(90)90101-5",{"id":26,"text":1045,"url":26,"identifiers":1046},"Lamken, E., Mills, W. H., Mullin, R.C., and Vanstone, S.A.: Covering of pairs by quintuples. J. Comb. TheoryA 44, 49–68 (1987)",{"doi":1047},"10.1016\u002F0097-3165(87)90059-8",{"id":26,"text":1049,"url":26,"identifiers":1050},"Lorea, M., On Turán hypergraphs. Discrete Mathematics22, 281–285 (1978)",{"doi":1051},"10.1016\u002F0012-365X(78)90061-4",{"id":26,"text":1053,"url":26,"identifiers":1054},"Mantel, W.: Vraagstuk XXVIII. Wiskundige Opgaven met de Oplossingen10, 60–61 (1907)",{},{"id":26,"text":1056,"url":26,"identifiers":1057},"Mills, W.H.: On the covering of pairs by quadruples I. J. Comb. TheoryA 13, 55–78 (1972)",{"doi":1058},"10.1016\u002F0097-3165(72)90008-8",{"id":26,"text":1060,"url":26,"identifiers":1061},"Mills, W.H.: On the covering of pairs by quadruples II. J. Comb. TheoryA 13, 138–166 (1973)",{"doi":1062},"10.1016\u002FS0097-3165(73)80003-2",{"id":26,"text":1064,"url":26,"identifiers":1065},"Mills, W.H.: On the covering of triples by quadruples. In: Proceedings of the Fifth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Fla., 1974, pp. 573–581. Winnipeg: Utilitas 1974",{},{"id":26,"text":1067,"url":26,"identifiers":1068},"Mills, W.H.: Covering designs I: covering by a small number of subsets. Ars Combinatoria8, 199–315 (1979)",{},{"id":26,"text":1070,"url":26,"identifiers":1071},"Mills, W.H.: A covering of pairs by quintuples. Ars Combinatoria18, 21–31 (1984)",{},{"id":26,"text":1073,"url":26,"identifiers":1074},"Mills, W.H., Mullin, R.C.: Covering triples by quadruples: an asymptotic solution. J. Comb. TheoryA 41, 117–138 (1986)",{"doi":1075},"10.1016\u002F0097-3165(86)90119-6",{"id":26,"text":1077,"url":26,"identifiers":1078},"Mills, W.H., Mullin, R.C.: Covering pairs by quintuples: the casev ≡ 3 modulo 4. J. Comb. TheoryA 49, 308–322 (1988)",{"doi":1079},"10.1016\u002F0097-3165(88)90058-1",{"id":26,"text":1081,"url":26,"identifiers":1082},"Mills, W.H., Mullin, R.C.: Coverings and packings. In: Contemporary Design Theory: A Collection of Surveys, pp. 371–399. Wiley 1992",{},{"id":26,"text":1084,"url":26,"identifiers":1085},"Mullin, R.C.: On covering pairs by quintuples: the casesv ≡ 3 or 11 modulo 20, J. of Combinatorial Mathematics and Combinatorial Computing2, 133–146 (1987)",{},{"id":26,"text":1087,"url":26,"identifiers":1088},"Mullin, R.C.: On the determination of the covering numbersC(2, 5, v). J. of Combinatorial Mathematics and Combinatorial Computing4, 123–132 (1988)",{},{"id":26,"text":1090,"url":26,"identifiers":1091},"Radziszowski, S.P., Zou, J.: Personal communication",{},{"id":26,"text":1093,"url":26,"identifiers":1094},"Rödl, V.: On a packing and covering problem Europ. J. Comb.5, 69–78 (1985)",{"doi":1095},"10.1016\u002FS0195-6698(85)80023-8",{"id":26,"text":1097,"url":26,"identifiers":1098},"Schönheim, J.: On coverings. Pacific J. of Mathematics14, 1405–1411 (1964)",{"doi":1099},"10.2140\u002Fpjm.1964.14.1405",{"id":26,"text":1101,"url":26,"identifiers":1102},"Sidorenko, A.F.: On Turán numbersT(n, 5, 4) and numbers of monochromatic 4-cliques in 2-colored 3-graphs (in Russian). Voprosi Kibernetiki no. 64, 117–124 (1980)",{},{"id":26,"text":1104,"url":26,"identifiers":1105},"Sidorenko, A.F.: Systems of sets that have theT-property. Moscow University Mathematics Bulletin36, no. 5, 22–26 (1981)",{},{"id":26,"text":1107,"url":26,"identifiers":1108},"Sidorenko, A.F.: The method of quadratic forms and Turán's combinatorial problem. Moscow University Mathematics Bulletin37, no. 1, 1–5 (1982)",{},{"id":26,"text":1110,"url":26,"identifiers":1111},"Sidorenko, A.F. Extremal constants and inequalities for distributions of sums of random vectors (in Russian). Ph.D. Thesis, Moscow State University, 1982",{},{"id":26,"text":1113,"url":26,"identifiers":1114},"Sidorenko, A.F.: The Turán problem for 3-graphs (in Russian). Combinatorial Analysis (Russian), no. 6, pp. 51–57. Moscow State University, 1983",{},{"id":26,"text":1116,"url":26,"identifiers":1117},"Sidorenko, A.F.: Exact values of Turán numbers. Math. Notes42, 913–918 (1987)",{"doi":1118},"10.1007\u002FBF01137440",{"id":26,"text":1120,"url":26,"identifiers":1121},"Sidorenko, A.: Upper bounds on Turán numbers. Submitted to J. Comb. Theory, ser. A",{"doi":1122},"10.1006\u002Fjcta.1996.2739",{"id":26,"text":1124,"url":26,"identifiers":1125},"Stanton, R.G., Bate, J.A.: A computer search for B-coverings. Lect. Notes in Math., no. 829, 37–50 (1980)",{"doi":1126},"10.1007\u002FBFb0088898",{"id":26,"text":1128,"url":26,"identifiers":1129},"Stanton, R.G., Buskens, R.W., and Allston, J.L.: Computation of the covering numberN(2, 5, 24). Utilitas Mathematica37, 127–144 (1990)",{},{"id":26,"text":1131,"url":26,"identifiers":1132},"Surányi, J.: Some combinatorial problems of geometry (in Hungarian). Mat. Lapok22, 215–230 (1971)",{},{"id":26,"text":1134,"url":26,"identifiers":1135},"Todorov D.T., Tonchev, V.D.: On some coverings of triples. C. R. Bulg. Acad. Sci.35, 1209–1211 (1982)",{},{"id":26,"text":1137,"url":26,"identifiers":1138},"Todorov, D.T.: A method of constructing coverings. Math. Notes35, 869–876 (1984)",{"doi":1139},"10.1007\u002FBF01139950",{"id":26,"text":1141,"url":26,"identifiers":1142},"Todorov D.T.: Some coverings derived from finite planes. In: Colloq. Math. Soc. János Bolyai, Vol. 37, Finite and Infinite Sets, Eger, 1981, pp. 697–710. Budapest: Akad. Kiadó 1985",{},{"id":26,"text":1144,"url":26,"identifiers":1145},"Todorov, D.T.: On the covering of pairs by 13 blocks. C. R. Bulg. Acad. Sci.38, 691–694 (1985)",{},{"id":26,"text":1147,"url":26,"identifiers":1148},"Todorov, D.T.: On the covering of triples by eight blocks. Serdica12, 20–29 (1986)",{},{"id":26,"text":1150,"url":26,"identifiers":1151},"Todorov, D.T.: Lower bounds for coverings of pairs by large blocks. Combinatorica9, 217–225 (1989)",{"doi":1152},"10.1007\u002FBF02124682",{"id":26,"text":1154,"url":26,"identifiers":1155},"Turán, P.: Egy gráfelméleti szélsöértékfeladatról. Mat. és Fiz. Lapok48, 436–453 (1941)",{},{"id":26,"text":1157,"url":26,"identifiers":1158},"Turán, P.: Research problems. Maguar Tud. Akad. Mat. Kutato Int. Közl.6, 417–423 (1961)",{},{"id":26,"text":1160,"url":26,"identifiers":1161},"Turán, P.: Applications of graph theory to geometry and potential theory. In: Combinatorial Structures and Their Applications, pp. 423–434. New York: Gordon and Breach 1970",{},{"id":1163,"createTime":1164,"updateTime":1165,"relativeEntities":1166,"slug":1167,"properties":1168,"entityType":814,"verifyStatus":25,"verifyTime":1165,"verifyNote":815,"syncStatus":28,"languages":1179,"translateLanguages":26,"viewCount":36,"primaryUrl":1180,"fullTextUrl":26,"authors":1181,"publicationType":839,"publisherRelationship":1228,"citationCount":1257,"citationInfo":1258,"publishDate":1260,"publishYear":1261,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1262,"isForceReanalyzing":877},"d22cf3f2-b80c-4cc2-8903-5a2ab23efa86","2024-04-16T06:26:54.822+00:00","2024-12-15T08:55:34.218+00:00",[],"Large-fault-tolerant-interconnection-networks",{"mag":1169,"keywords":1171,"openalex":1172,"abstract":1174,"title":1175,"doi":1177},{"VOID":1170},"2014754781",{},{"VOID":1173},"W2014754781",{},{"EN":1176},"Large fault-tolerant interconnection networks",{"VOID":1178},"10.1007\u002Fbf01788663",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01788663",[1182,1200,1214],{"id":1183,"sortIndex":115,"researcher":26,"roles":1184,"affiliations":1185,"properties":1195},"10ec3d77-c18d-4f36-a32d-ef7457c746c4",[],[1186],{"id":26,"sortIndex":36,"affiliation":1187,"properties":26},{"id":1188,"createTime":1189,"updateTime":1189,"relativeEntities":1190,"slug":1191,"properties":1192,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"8b977525-487e-492a-9158-00a1695273d8","2024-04-16T06:26:54.846+00:00",[],"Laboratoire-de-recherche-en-Informatique-Universite-Paris-Sud-Orsay-France",{"title":1193},{"EN":1194},"Laboratoire de recherche en Informatique, Universite Paris-Sud, Orsay, France",{"openalex":1196,"title":1198},{"VOID":1197},"A5039294122",{"EN":1199},"Nathalie Homobono",{"id":1201,"sortIndex":114,"researcher":26,"roles":1202,"affiliations":1203,"properties":1209},"16694648-5ce7-4b77-a7cf-bd7477585635",[],[1204],{"id":26,"sortIndex":36,"affiliation":1205,"properties":26},{"id":1188,"createTime":1189,"updateTime":1189,"relativeEntities":1206,"slug":1191,"properties":1207,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1208},{"EN":1194},{"openalex":1210,"title":1212},{"VOID":1211},"A5039509821",{"EN":1213},"Claudine Peyrat",{"id":1215,"sortIndex":36,"researcher":26,"roles":1216,"affiliations":1217,"properties":1223},"83e48313-4f32-4590-8a9d-e2087c73af9f",[],[1218],{"id":26,"sortIndex":36,"affiliation":1219,"properties":26},{"id":1188,"createTime":1189,"updateTime":1189,"relativeEntities":1220,"slug":1191,"properties":1221,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1222},{"EN":1194},{"openalex":1224,"title":1226},{"VOID":1225},"A5085133941",{"EN":1227},"Jean‐Claude Bermond",{"url":26,"publisher":1229,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1230,"slug":663,"properties":1231,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1235,"manageAffiliations":1236,"indexDatabases":1237,"url":26,"thumbnailPath":26,"statistic":1252,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1232,"eissn":1233,"title":1234},{"VOID":666},{"VOID":668},{"EN":670},[],[],[1238,1245],{"id":712,"indexDatabase":1239,"url":725,"indexYears":726,"academicFieldIds":1244,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":1240,"label":1241,"description":1242,"key":722,"publicationTags":1243,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":1246,"url":747,"indexYears":26,"academicFieldIds":1251,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":1247,"label":1248,"description":1249,"key":743,"publicationTags":1250,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":1253,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":1254,"totalCitation":757,"totalCitationByYear":1255,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":1256,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},99,{"total":1257,"publishYear":26,"statisticByYear":1259},{"2013":162,"2014":115,"2015":114,"2018":115,"2020":59,"2021":114,"2023":115},"1989-12-01",1989,[1263,1266,1270,1274,1277,1280,1283,1286,1289,1292,1296,1299,1302,1306,1309,1313,1317,1320,1323,1326,1329,1333,1337,1341,1344,1347,1351,1354,1358,1361,1364,1368,1372,1375,1379,1383,1387,1391,1395,1398,1402,1405,1409,1413,1417,1420,1423,1426,1430,1434,1437,1441,1445,1448,1451,1455,1459,1462,1466,1469,1472,1475,1478,1482,1486,1490,1494,1498,1502,1506,1509,1512,1515,1519,1522,1526,1530,1534,1538,1541,1545,1548,1551,1554,1557,1561,1565,1568,1571,1574,1577,1580,1584,1588,1592,1595,1598,1602,1605,1608,1612,1616,1620,1623,1626,1629,1633,1637,1640,1644,1648],{"id":26,"text":1264,"url":26,"identifiers":1265},"Akers, S.B., Harel, D., Krishnamurthy, B.: The star graph: an attractive alternative to then-cube. 16th Conf. on Parallel Processing, 1987, pp. 393–400",{},{"id":26,"text":1267,"url":26,"identifiers":1268},"Akers, S.B., Krishnamurthy, B.: On group graphs and their fault tolerance. IEEE Trans. Comput.C-36, 885–888 (1987)",{"doi":1269},"10.1109\u002FTC.1987.1676983",{"id":26,"text":1271,"url":26,"identifiers":1272},"Amar, D.: On the connectivity of some telecommunication networks. IEEE Trans. Comput.C-32, 512–519 (1983)",{"doi":1273},"10.1109\u002FTC.1983.1676267",{"id":26,"text":1275,"url":26,"identifiers":1276},"Ameter, D., de Gree, Max: Graphs and Interconnection networks. (Forthcoming book)",{},{"id":26,"text":1278,"url":26,"identifiers":1279},"Berge, C.: Graphs and hypergraphs. New-York: North-Holland Publishing Co. (1973)",{},{"id":26,"text":1281,"url":26,"identifiers":1282},"Bermond, J.-C., Homobono, N., Peyrat, C.: Large fault-tolerant interconnection networks. LRI Research Report, 1986",{},{"id":26,"text":1284,"url":26,"identifiers":1285},"Bermond, J.-C., Bollobas, B.: The diameter of graphs- a survey. Proc. 12-th Southeastern Conference, Congressus Num.32, 3–27 (1981)",{},{"id":26,"text":1287,"url":26,"identifiers":1288},"Bermond, J.-C., Bond, J., Paoli, M., Peyrat, C.: Graphs and interconnection networks: diameter and vulnerability. In surveys in combinatorics: Proc. 9-th British Combinatorial Conference, London Math. Soc., Lec. Notes Ser.82, 1–30 (1983)",{},{"id":26,"text":1290,"url":26,"identifiers":1291},"Bermond, J.-C., Comellas, F., Hsu, F.: Distributed loop computer networks: a survey. IEEE trans. Comput. (1988) (submitted)",{},{"id":26,"text":1293,"url":26,"identifiers":1294},"Bermond, J.-C., Delorme, C., Quisquater, J.-J.: Strategies for interconnection networks: some methods from graph theory. J. of Parallel and Distributed Comput.3, 433–449 (1986)",{"doi":1295},"10.1016\u002F0743-7315(86)90008-0",{"id":26,"text":1297,"url":26,"identifiers":1298},"Bermond, J.-C., Favaron, O., Maheo, M.: Hamiltonian decomposition of Cayley graphs of degree four. J. Comb. Theory (B) (1988)",{},{"id":26,"text":1300,"url":26,"identifiers":1301},"Bermond, J.-C., Illiades, G., Peyrat, C.: An optimization problem in distributed loop computer networks. In: Proc. third international conference on combinatorial math., New York, 1985, Annals N.Y. Acad. Science (1988)",{},{"id":26,"text":1303,"url":26,"identifiers":1304},"Bhatt, S., Chung F.R.K., Leighton, T., Rosenberg, A.: Optimal simulations of tree machines. Proc. FOCS. pp. 274–282 (1986)",{"doi":1305},"10.1109\u002FSFCS.1986.38",{"id":26,"text":1307,"url":26,"identifiers":1308},"Boesch, F.T.: Graph theoretic models for network reliability studies. Stevens Institute of technology, electrical engineering and computer science department, Technical Report 8010, 1980",{},{"id":26,"text":1310,"url":26,"identifiers":1311},"Boesch, F.T., Tindell, R.: Circulants and their connectivities. J. Graph Theory8, 487–499 (1984)",{"doi":1312},"10.1002\u002Fjgt.3190080406",{"id":26,"text":1314,"url":26,"identifiers":1315},"Boesch, F.T., Wang, J.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circuits Syst.CAS-32, 1286–1291 (1985)",{"doi":1316},"10.1109\u002FTCS.1985.1085667",{"id":26,"text":1318,"url":26,"identifiers":1319},"Bollobas, B.: Graphs with given diameter and minimal degree. Ars Comb.2, 3–9 (1976)",{},{"id":26,"text":1321,"url":26,"identifiers":1322},"Bond, J., Delorme, C., de la Vega, W.F.: Large Cayley graphs with small degree and diameter. LRI Research report 392, 1987",{},{"id":26,"text":1324,"url":26,"identifiers":1325},"Bond, J., Peyrat, C.: Diameter vulnerability in networks. In: Proc. of Kalamazoo Colloquium 1984, Graph theory and its applications to algorithms and computer science. pp. 123–149, New York: Wiley 1985",{},{"id":26,"text":1327,"url":26,"identifiers":1328},"Bond, J., Peyrat, C.: Diameter vulnerability of some large interconnection networks, The 19-th Southeastern Conference on Combinatorics, Graph Theory and Computing. Baton rouge, 1988",{},{"id":26,"text":1330,"url":26,"identifiers":1331},"Bondy, J.A., Hell, P.: Counterexamples to theorems of Menger type for the diameter. Discrete Math.44, 217–220 (1983)",{"doi":1332},"10.1016\u002F0012-365X(83)90062-6",{"id":26,"text":1334,"url":26,"identifiers":1335},"Boyles, S.M., Exoo, G.: A counterexample to a conjecture on paths of bounded length. J. Graph Theory6, 205–209 (1982)",{"doi":1336},"10.1002\u002Fjgt.3190060215",{"id":26,"text":1338,"url":26,"identifiers":1339},"Broder, A., Dolev, D., Fischer, M., Simons, B.: Efficient fault-tolerant routings in networks. In: Proc. ACM 16-th STOC. pp. 536–541. (1984)",{"doi":1340},"10.1145\u002F800057.808724",{"id":26,"text":1342,"url":26,"identifiers":1343},"de Bruijn, N.G.: A combinatorial problem. Koninklijke Nederlandse Academie van Wetenschappen Proc.A49, 758–764 (1946)",{},{"id":26,"text":1345,"url":26,"identifiers":1346},"Campbell, L., Carlsson, G.E., Faber, V., Fellows, M.R., Langston, M.A., Moore, J.W., Mullhaupt, A.P., Sexton, H.B.: Dense symmetric networks from linear groups and codes (1988) (preprint)",{},{"id":26,"text":1348,"url":26,"identifiers":1349},"Carlsson, G.E., Cruthirds, J.E., Sexton, H.B., Wright, C.G. Interconnection networks based on a generalization of cube-connected cycles. IEEE Trans. Comput.C-34, 769–772 (1985)",{"doi":1350},"10.1109\u002FTC.1985.1676627",{"id":26,"text":1352,"url":26,"identifiers":1353},"Chudnovsky, D.V., Chudnovsky, G.V., Denneau, M.M.: Regular graphs with small diameter as models for interconnection networks in 3rd Int. Conf. on Supercomputing Boston, 232–239 (1988)",{},{"id":26,"text":1355,"url":26,"identifiers":1356},"Chung, F.R.K.: Diameter of communication networks. Proceedings of Symposia in Applied Mathematics34, 1–18 (1986)",{"doi":1357},"10.1090\u002Fpsapm\u002F034\u002F846852",{"id":26,"text":1359,"url":26,"identifiers":1360},"Chung, F.R.K.: Diameters of graphs: old problems and new results. In: Proc. 18-th southeastern conference on Combinatorics, Graph theory and Computing Congresses Numeration 60, 295–317 (1987)",{},{"id":26,"text":1362,"url":26,"identifiers":1363},"Chung, F.R.K.: Graphs with small diameter after edge deletion (1988) (preprint)",{},{"id":26,"text":1365,"url":26,"identifiers":1366},"Chung, F.R.K., Coffman, E.G., Reiman, M.I., Simon, B.E.: The forwarding index of communication networks. IEEE Trans. Informat. Theory.IT-33, 224–232 (1987)",{"doi":1367},"10.1109\u002FTIT.1987.1057290",{"id":26,"text":1369,"url":26,"identifiers":1370},"Chung, F.R.K., Garey, M.R.: Diameter bounds for altered graphs. J. Graph Theory8, 511–534 (1984)",{"doi":1371},"10.1002\u002Fjgt.3190080408",{"id":26,"text":1373,"url":26,"identifiers":1374},"Colbourn, C.J.: The Combinatorics of Networks Reliability. Oxford: Oxford University Press 1987",{},{"id":26,"text":1376,"url":26,"identifiers":1377},"Dolev, D., Halpern, J., Simons, B., Strong, R.: A new look at fault-tolerant network routings. In: Proc. ACM, 16-th STOC. 526–535, 1984",{"doi":1378},"10.1145\u002F800057.808723",{"id":26,"text":1380,"url":26,"identifiers":1381},"van Doorn, E.A.: Connectivity of circulant digraphs. J. Graph Theory10, 9–14 (1986)",{"doi":1382},"10.1002\u002Fjgt.3190100103",{"id":26,"text":1384,"url":26,"identifiers":1385},"Du, D.Z., Hsu, D.F., Hwang, F.K.: Doubly-linked ring networks. IEEE Trans. Comput.C-34, 853–855 (1985)",{"doi":1386},"10.1109\u002FTC.1985.1676641",{"id":26,"text":1388,"url":26,"identifiers":1389},"Du, D.Z., Hsu, D.Z., Hwang, F.K., Zhang, X.M.: The hamiltonian property of generalized de Bruijn digraphs. J. Comb. Theory (to appear)",{"doi":1390},"10.1016\u002F0095-8956(91)90084-W",{"id":26,"text":1392,"url":26,"identifiers":1393},"Du, D.Z., Hwang, F.K.: Generalized de Bruijn digraphs. Networks 18, 27–38 (1988)",{"doi":1394},"10.1002\u002Fnet.3230180105",{"id":26,"text":1396,"url":26,"identifiers":1397},"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. Comput. (to appear)",{},{"id":26,"text":1399,"url":26,"identifiers":1400},"Entringer, R.C., Jackson, D.E., Slater, P.J.: Geodetic connectivity of graphs. IEEE Trans. Circuits Syst.Cas-24, 460–463 (1977)",{"doi":1401},"10.1109\u002FTCS.1977.1084370",{"id":26,"text":1403,"url":26,"identifiers":1404},"Escudero, M., Fabrega, J., Morillo, P.: Fault-tolerant routings in double-loop networks, In: Proc. 11-th British Combinatorical Conference 1987, Ars Comb. (to appear)",{},{"id":26,"text":1406,"url":26,"identifiers":1407},"Esfahanian, A.H.: Lower-bounds on the connectivities of a graph. J. Graph Theory9, 503–511 (1985)",{"doi":1408},"10.1002\u002Fjgt.3190090411",{"id":26,"text":1410,"url":26,"identifiers":1411},"Esfahanian, A.H., Hakimi, S.L.: Fault-tolerant routing in de Bruijn communication networks. IEEE Trans. Comput.C-34, 777–788 (1985)",{"doi":1412},"10.1109\u002FTC.1985.1676633",{"id":26,"text":1414,"url":26,"identifiers":1415},"Exoo, G.: On a measure of communication network vulnerability. Networks12, 405–409 (1982)",{"doi":1416},"10.1002\u002Fnet.3230120405",{"id":26,"text":1418,"url":26,"identifiers":1419},"Fábrega, J., Fiol, M.A., Escudero, M.: The connectivity of iterated line digraphs. Submitted to J. of Graph Theory",{},{"id":26,"text":1421,"url":26,"identifiers":1422},"Fábrega, J., Fiol, M.A., Yebra, J.L.A., Alegre, I.: Connectivity and reliable routing algorithms in line digraphs. In: Proc. 3rd Int. Symp. Applied Informatics, pp. 45–50. Switzerland: Grindenwald 1985",{},{"id":26,"text":1424,"url":26,"identifiers":1425},"Faudree, R.J., Ordman, E.T., Schelp, R.H., Jacobson, M.S., Tuza, Z.: Menger's theorem and short paths. J. Comp. Math. and Comp. Combinatorics2, 235–253 (1987)",{},{"id":26,"text":1427,"url":26,"identifiers":1428},"Favaron, O., Kouider, M., Maheo, M.: Edge-vulnerability and mean distance. Networks (to appear)",{"doi":1429},"10.1002\u002Fnet.3230190502",{"id":26,"text":1431,"url":26,"identifiers":1432},"Feldman, P.: Fault tolerance of minimal path routings in a network. In: Proc. 17-th STOC, pp. 327–334, 1985",{"doi":1433},"10.1145\u002F22145.22181",{"id":26,"text":1435,"url":26,"identifiers":1436},"Fiol, M.A., Fábrega, J., Homobono, N., Escudero, M.: On surviving route graphs of iterated line digraphs. Submitted to Proc. of Kalamazoo Colloquium (1988)",{},{"id":26,"text":1438,"url":26,"identifiers":1439},"Fiol, M.A., Yebra, A., Alegre, I., Valero, M.: A discrete optimization problem in local networks and data alignment. IEEE Trans. Comput.C-36, 702–713 (1987)",{"doi":1440},"10.1109\u002FTC.1987.1676963",{"id":26,"text":1442,"url":26,"identifiers":1443},"Fiol, M.A., Yebra, J.L.A., Alegre, I.: Line digraph iterations and the (d, k) digraph problem. IEEE Trans. Computer.C-33, 400–403 (1984)",{"doi":1444},"10.1109\u002FTC.1984.1676455",{"id":26,"text":1446,"url":26,"identifiers":1447},"Gomez, J.: Diametroy vulnerabilidad en redes de interconexion. Thesis, Universitat Politecnica de Catalunya, Barcelona, September 1986",{},{"id":26,"text":1449,"url":26,"identifiers":1450},"Greenberg, D.S., Heath, L.S., Rosenberg, A.: Optimal embeddings of the FFT graph in the hypercube (1988) (preprint)",{},{"id":26,"text":1452,"url":26,"identifiers":1453},"Hamidoune, Y.O.: On the connectivity of Cayley digraphs. Europ. J. Comb.5, 309–312 (1984)",{"doi":1454},"10.1016\u002FS0195-6698(84)80034-7",{"id":26,"text":1456,"url":26,"identifiers":1457},"Hartman, J., Rubin, I.: On diameter stability of graphs. Lect. Notes Math.642, 247–254 (1976)",{"doi":1458},"10.1007\u002FBFb0070382",{"id":26,"text":1460,"url":26,"identifiers":1461},"Heydemann, M.C., Meyer, J.-C., Opatrny, J., Sotteau, D.: Consistent routings and forwarding indices (1988) (preprint)",{},{"id":26,"text":1463,"url":26,"identifiers":1464},"Heydemann, M.C., Meyer, J.-C., Sotteau, D.: On forwarding indices of networks. Discrete App. Math. (1988)",{"doi":1465},"10.1016\u002F0166-218X(89)90022-X",{"id":26,"text":1467,"url":26,"identifiers":1468},"Hillis, W.D.: The connection machine. In: ACM Distinguished Dissertation. The MIT press (1985)",{},{"id":26,"text":1470,"url":26,"identifiers":1471},"Homobono, N.: Resistance aux pannes de grands reseaux d'interconnection. These de troisieme cycle, Universite de Paris-sud, LRI 1987",{},{"id":26,"text":1473,"url":26,"identifiers":1474},"Homobono, N.: Connectivity of the undirected Imase and Itoh networks. In: Proc. 11-th British Conference, Ars Comb.25C, 179–194 (1988)",{},{"id":26,"text":1476,"url":26,"identifiers":1477},"Homobono, N., Peyrat, C.: Fault-tolerant routings in Kautz and de Bruijn digraphs. (To appear in the Combinatorial conference, Montreal, Quebec, 1987)",{},{"id":26,"text":1479,"url":26,"identifiers":1480},"Homobono, N., Peyrat, C.: Connectivity of Imase and Itoh digraphs. IEEE Trans. Comput.37, 1459–1461 (1988)",{"doi":1481},"10.1109\u002F12.8718",{"id":26,"text":1483,"url":26,"identifiers":1484},"Imase, M., Itoh, M.: Design to minimize a diameter on building block network. IEEE Trans. Comput.C-30, 439–443 (1981)",{"doi":1485},"10.1109\u002FTC.1981.1675809",{"id":26,"text":1487,"url":26,"identifiers":1488},"Imase, M., Itoh, M.: A design for directed graphs with minimum diameter. IEEE Trans. Comput.C-32, 782–784 (1983)",{"doi":1489},"10.1109\u002FTC.1983.1676323",{"id":26,"text":1491,"url":26,"identifiers":1492},"Imase, M., Manabe, Y.: Fault tolerant routing in ak-connected network. Information Processing Letters, 1988",{"doi":1493},"10.1016\u002F0020-0190(88)90204-9",{"id":26,"text":1495,"url":26,"identifiers":1496},"Imase, M. Soneoka, T., Okada, K.: Connectivity of regular directed graphs with small diameter. IEEE Trans. Comput.C-34, 267–273 (1985)",{"doi":1497},"10.1109\u002FTC.1985.1676569",{"id":26,"text":1499,"url":26,"identifiers":1500},"Imase, M., Soneoka, T., Okada, K.: A fault tolerant processor interconnection network. Denshi Tsushin Gakkai RonbunshiJ68-D, 8, 1449–1456 (in Japanese; translated in Systems and Computers in Japan, vol.17, No. 8, 21–30, 1986.)",{"doi":1501},"10.1002\u002Fscj.4690170803",{"id":26,"text":1503,"url":26,"identifiers":1504},"Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks12, 277–286 (1982)",{"doi":1505},"10.1002\u002Fnet.3230120306",{"id":26,"text":1507,"url":26,"identifiers":1508},"Jolivet, J.-L.: Sur la connexite des graphes orientes. C.R. Acad. Sci., Paris,274A, 148–150 (1972)",{},{"id":26,"text":1510,"url":26,"identifiers":1511},"Kautz, W.H.: Bounds on directed (d, k) graphs. Theory of cellular logic networks and machines, AFCRL-68-0668 Final Report, pp. 20–28, 1968",{},{"id":26,"text":1513,"url":26,"identifiers":1514},"Kerjouan, R.: The edge-vulnerability of the diameter of interconnection networks. LRI Research Report 261, 1986, J. Graph Theory (submitted)",{},{"id":26,"text":1516,"url":26,"identifiers":1517},"Krishnamoorthy, M.S., Krishnamurthy, B.: Fault diameter of interconnection networks. Comput. Math. Applic.13, 577–582 (1987)",{"doi":1518},"10.1016\u002F0898-1221(87)90085-X",{"id":26,"text":1520,"url":26,"identifiers":1521},"Kumar, V.P., Reddy, S.M.: A class of graphs for fault-tolerant processor interconnections. In: IEEE 1984 Int. Conf. Distributed Computing Systems, pp. 448–460, 1984",{},{"id":26,"text":1523,"url":26,"identifiers":1524},"Lovász, L., Neumann-Lara, V., Plummer, M.: Mengerian theorems for paths of bounded length. Period. Math. Hung.9, 269–276 (1978)",{"doi":1525},"10.1007\u002FBF02019432",{"id":26,"text":1527,"url":26,"identifiers":1528},"Mader, W.: Uber den Zusammenhang symmetrischer Graphen. Arch. Math.21, 331–336 (1970)",{"doi":1529},"10.1007\u002FBF01220924",{"id":26,"text":1531,"url":26,"identifiers":1532},"Mader, W.: Minimalen-fach kantenzusammenhängende Graphen. Math. Ann.191, 21–28 (1971)",{"doi":1533},"10.1007\u002FBF01433466",{"id":26,"text":1535,"url":26,"identifiers":1536},"Mader, W.: Connectivity and edge-connectivity in finite graphs. In: Surveys in Combinatorics: Proc. Seventh British Combinatorial Conference, Cambridge 1979, pp. 66–95. London Math. Soc. Lect. Note Ser.38, (1979)",{"doi":1537},"10.1017\u002FCBO9780511662133.005",{"id":26,"text":1539,"url":26,"identifiers":1540},"Manabe, Y., Imase, M., Soneoka, T.: Reliable and efficient fixed routings in digraphs. Invited paper, IECIE, Japan 1988",{},{"id":26,"text":1542,"url":26,"identifiers":1543},"Meyer, F.J., Pradhan, D.K.: Flip-trees: fault-tolerant graphs with wide containers. IEEE Trans. Comput.37, 472–478 (1988)",{"doi":1544},"10.1109\u002F12.2194",{"id":26,"text":1546,"url":26,"identifiers":1547},"Morillo, P., Comellas, F., Fiol, M.A.: Diameter, mean distance and vulnerability of some graphs related to plane tesselations. Submitted to J. Graph Theory",{},{"id":26,"text":1549,"url":26,"identifiers":1550},"Morillo, P., Fiol, M.A., Guitart, J.: On the (d, D, D, s)-digraph problem. 5th Int. Conf. on Applied Algebra, Error-Correcting Codes and Cryptography, AAECC-5, 1987",{},{"id":26,"text":1552,"url":26,"identifiers":1553},"Opatrny, J.: A new family of 3-regular network models. In: Proc. of Int. Computer Symposium, Taiwan, pp. 1397–1401, 1986",{},{"id":26,"text":1555,"url":26,"identifiers":1556},"Opatrny, J., Srinivasan, N., Alagar, V.S.: Highly fault-tolerant communication networks models. Submitted to IEEE on Circuits and System",{},{"id":26,"text":1558,"url":26,"identifiers":1559},"Peleg, D., Simons, B.: On fault tolerant routings in general networks. PODCS, pp. 98–107, 1986",{"doi":1560},"10.1145\u002F10590.10599",{"id":26,"text":1562,"url":26,"identifiers":1563},"Peyrat, C.: Diameter vulnerability of graphs. Discrete Appl. Math.9, 245–250 (1984)",{"doi":1564},"10.1016\u002F0166-218X(84)90024-6",{"id":26,"text":1566,"url":26,"identifiers":1567},"Plesnik, J.: Note on diametrally critical graphs. In: Recent Advances in Graph Theory, Proc. 2-nd Czechoslovak Symp., Prague 1974, Academia Prague, pp. 455–465, 1975",{},{"id":26,"text":1569,"url":26,"identifiers":1570},"Plesnik, J.: Critical graphs of given diameter Acta Fac. Rerum Natur. Univ. Com. Mat.,30, 71–93 (1975)",{},{"id":26,"text":1572,"url":26,"identifiers":1573},"Pradhan, D.K.: Interconnecting topologies for fault-tolerant parallel and distributed architectures. In: Proc. ICPP, pp. 238–242, 1981",{},{"id":26,"text":1575,"url":26,"identifiers":1576},"Pradhan, D.K.: On a class of fault-tolerant multiprocessor network architectures. In: 3rd Int. Conf. on Distributed Processing, Miami, Floride, 1982",{},{"id":26,"text":1578,"url":26,"identifiers":1579},"Pradhan, D.K.: Fault-tolerant Computing. Theory and Techniques, Englewood Cliffs, NJ, Prentice-Hall, 1986.",{},{"id":26,"text":1581,"url":26,"identifiers":1582},"Pradhan, D.K., Reddy, S.M.: A Fault-tolerant communication architecture for distributed sustems. IEEE Trans. Comput.C-31, 863–870 (1982)",{"doi":1583},"10.1109\u002FTC.1982.1676101",{"id":26,"text":1585,"url":26,"identifiers":1586},"Preparata, F.R., Vuillemin, J.: The cube connected cycles: a versatile network for parallel computation. Commun. ACM24, 300–309 (1981)",{"doi":1587},"10.1145\u002F358645.358660",{"id":26,"text":1589,"url":26,"identifiers":1590},"Quaife, H.J.: On (d, k, μ) graphs, IEEE Trans. Comput.C-18, 270–272 (1969)",{"doi":1591},"10.1109\u002FT-C.1969.222642",{"id":26,"text":1593,"url":26,"identifiers":1594},"Reddy, S.M., Kuhl, J.G., Hosseini, S.H., Lee, H.: On digraphs with minimum diameter and maximum connectivity. In: Proceedings of 20-th Annual Allerton Conference, pp. 1018–1026, 1982",{},{"id":26,"text":1596,"url":26,"identifiers":1597},"Reddy, S.M., Pradhan, D.K., Kuhl, J.G.: Directed graphs with minimal diameter and maximum node connectivity. School of Engineering Oakland Univ., Tech. Rep., 1980",{},{"id":26,"text":1599,"url":26,"identifiers":1600},"Ronen, D., Perl, Y.: Heuristics for finding a maximum number of disjoint bounded paths. Networks14, 531–544 (1984)",{"doi":1601},"10.1002\u002Fnet.3230140405",{"id":26,"text":1603,"url":26,"identifiers":1604},"Schlumberger, M.: De Bruijn communications networks. Standford PhD Thesis, Computer Science Department, Stanford, California, 1974",{},{"id":26,"text":1606,"url":26,"identifiers":1607},"Schlumberger, M.: Connectivity of de Bruijn networks. Rapport de Recherche 154 Ensimag, Universite de Grenoble, 1978",{},{"id":26,"text":1609,"url":26,"identifiers":1610},"Schoone, A.A., Bodlaender, H.L., van Leeuwen, J.: Diameter increase caused by edge deletion. J. Graph Theory11, 409–427 (1987)",{"doi":1611},"10.1002\u002Fjgt.3190110315",{"id":26,"text":1613,"url":26,"identifiers":1614},"Schumacher, U.: An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter. Networks14, 63–74 (1984)",{"doi":1615},"10.1002\u002Fnet.3230140106",{"id":26,"text":1617,"url":26,"identifiers":1618},"Sengupta, A., Sen, A., Bandyopadhyay, S.: On an optimally fault-tolerant multiprocessor network architecture. IEEE trans. Comp.C-36, 619–623 (1987)",{"doi":1619},"10.1109\u002FTC.1987.1676947",{"id":26,"text":1621,"url":26,"identifiers":1622},"Soneoka, T., Imase, M., Manabe, Y.: Design of ad-connected digraph with a minimum number of edges and a quasiminimal diameter, Part II. Submitted to Networks",{},{"id":26,"text":1624,"url":26,"identifiers":1625},"Soneoka, T., Nakada, H., Imase, M.: Sufficient conditions for dense graphs to be maximally connected. In: Proc. of ISCAS 85, pp. 811–814, 1985",{},{"id":26,"text":1627,"url":26,"identifiers":1628},"Soneoka, T., Nakada, H., Imase, M.: Design of ad-connected digraph with a minimum number of edges and quasiminimal diameter. Submitted to Discrete Appl. Math.",{},{"id":26,"text":1630,"url":26,"identifiers":1631},"Soneoka, T., Nakada, H., Imase, M., Peyrat, C.: Sufficient conditions for maximally connected dense graphs. Discrete Math.63, 53–66 (1987)",{"doi":1632},"10.1016\u002F0012-365X(87)90151-8",{"id":26,"text":1634,"url":26,"identifiers":1635},"Suurballe, J.W.: Disjoint paths in a network. Networks4, 125–145 (1974)",{"doi":1636},"10.1002\u002Fnet.3230040204",{"id":26,"text":1638,"url":26,"identifiers":1639},"Vijayan, K., Murty, U.S.R.: On accessibility in graphs. Sankhya Ser. A,26, 299–302 (1964)",{},{"id":26,"text":1641,"url":26,"identifiers":1642},"Wagner, A.: Embedding arbitrary binary trees in a hypercube. Submitted to J. Parallel and Distributed Computing",{"doi":1643},"10.1016\u002F0743-7315(89)90033-6",{"id":26,"text":1645,"url":26,"identifiers":1646},"Watkins, W.E.: Connectivity of transitive graphs. J. Comb. Theory8, 23–29 (1970)",{"doi":1647},"10.1016\u002FS0021-9800(70)80005-9",{"id":26,"text":1649,"url":26,"identifiers":1650},"Wong, C.K., Coppersmith, D.: A combinatorial problem related to multimodule memory organizations. J. of Association for Communication for Computing Machinery21, 392–402 (1974)",{"doi":1651},"10.1145\u002F321832.321838",{"id":1653,"createTime":1654,"updateTime":1655,"relativeEntities":1656,"slug":1657,"properties":1658,"entityType":814,"verifyStatus":28,"verifyTime":1655,"verifyNote":1669,"syncStatus":28,"languages":1670,"translateLanguages":26,"viewCount":36,"primaryUrl":1671,"fullTextUrl":26,"authors":1672,"publicationType":839,"publisherRelationship":1693,"citationCount":251,"citationInfo":1722,"publishDate":872,"publishYear":873,"citationAnalyzeStatus":874,"lastCitationAnalyze":1724,"indexDatabases":26,"openAccess":26,"references":1725,"isForceReanalyzing":877},"4ab97875-b0be-47af-9819-31d184873f6b","2024-04-11T20:23:40.893+00:00","2025-01-09T03:05:23.058+00:00",[],"Maximal-Energy-Bipartite-Graphs",{"mag":1659,"keywords":1661,"openalex":1662,"abstract":1664,"title":1665,"doi":1667},{"VOID":1660},"2096364584",{},{"VOID":1663},"W2096364584",{},{"EN":1666},"Maximal Energy Bipartite Graphs",{"VOID":1668},"10.1007\u002Fs00373-002-0487-7","Author affiliation is blank",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00373-002-0487-7",[1673,1684],{"id":1674,"sortIndex":115,"researcher":26,"roles":1675,"affiliations":1676,"properties":1677},"cf5dc478-e120-47f4-bfa4-af9719f2236d",[],[],{"openalex":1678,"orcid":1680,"title":1682},{"VOID":1679},"A5042929579",{"VOID":1681},"https:\u002F\u002Forcid.org\u002F0000-0001-9371-6435",{"EN":1683},"Vincent Moulton",{"id":1685,"sortIndex":36,"researcher":26,"roles":1686,"affiliations":1687,"properties":1688},"87234ab1-38cc-4f48-9532-83a9edba8ff7",[],[],{"openalex":1689,"title":1691},{"VOID":1690},"A5048096758",{"EN":1692},"Jack H. Koolen",{"url":26,"publisher":1694,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1695,"slug":663,"properties":1696,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1700,"manageAffiliations":1701,"indexDatabases":1702,"url":26,"thumbnailPath":26,"statistic":1717,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1697,"eissn":1698,"title":1699},{"VOID":666},{"VOID":668},{"EN":670},[],[],[1703,1710],{"id":712,"indexDatabase":1704,"url":725,"indexYears":726,"academicFieldIds":1709,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":1705,"label":1706,"description":1707,"key":722,"publicationTags":1708,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":1711,"url":747,"indexYears":26,"academicFieldIds":1716,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":1712,"label":1713,"description":1714,"key":743,"publicationTags":1715,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":1718,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":1719,"totalCitation":757,"totalCitationByYear":1720,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":1721,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"total":251,"publishYear":26,"statisticByYear":1723},{"2012":53,"2013":135,"2014":135,"2015":135,"2016":59,"2018":111,"2019":114,"2020":114,"2021":59,"2022":59,"2023":115},"2024-04-12T00:29:18.561+00:00",[],{"id":1727,"createTime":1728,"updateTime":1728,"relativeEntities":1729,"slug":1730,"properties":1731,"entityType":814,"verifyStatus":25,"verifyTime":1728,"verifyNote":815,"syncStatus":28,"languages":1742,"translateLanguages":26,"viewCount":36,"primaryUrl":1743,"fullTextUrl":26,"authors":1744,"publicationType":839,"publisherRelationship":1785,"citationCount":359,"citationInfo":1821,"publishDate":1823,"publishYear":1824,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1825,"isForceReanalyzing":877},"d0e28b64-3f5b-4449-a12b-d54d2466008e","2024-10-03T19:18:19.478+00:00",[],"Ordering-trees-by-algebraic-connectivity",{"mag":1732,"keywords":1734,"openalex":1735,"abstract":1737,"title":1738,"doi":1740},{"VOID":1733},"2047018652",{},{"VOID":1736},"W2047018652",{},{"EN":1739},"Ordering trees by algebraic connectivity",{"VOID":1741},"10.1007\u002Fbf01787574",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01787574",[1745,1765],{"id":1746,"sortIndex":115,"researcher":26,"roles":1747,"affiliations":1748,"properties":1760},"1930420d-b955-4617-8323-4555d33b8bba",[],[1749],{"id":1750,"sortIndex":36,"affiliation":1751,"properties":26},"61cf0e44-f015-4318-839c-b4c1d0cd2043",{"id":1752,"createTime":1753,"updateTime":1754,"relativeEntities":1755,"slug":1756,"properties":1757,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"6cc6521b-e285-460e-b6c7-c4eb85364b12","2023-12-02T18:48:17.140+00:00","2024-10-03T19:18:19.508+00:00",[],"Department-of-Mathematics-and-Computer-Science-California-State-University-Hayward-USA",{"title":1758},{"VI":1759},"Department of Mathematics and Computer Science, California State University, Hayward, USA",{"openalex":1761,"title":1763},{"VOID":1762},"A5075558471",{"EN":1764},"Russell Merris",{"id":1766,"sortIndex":36,"researcher":26,"roles":1767,"affiliations":1768,"properties":1780},"10c3ee6c-fafd-4dfa-92a7-79f4bbecc880",[],[1769],{"id":1770,"sortIndex":36,"affiliation":1771,"properties":26},"6820a5c2-0782-4cef-816b-9c0fa10f1f69",{"id":1772,"createTime":1773,"updateTime":1774,"relativeEntities":1775,"slug":1776,"properties":1777,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"e5760b81-66c1-4293-af23-081de46b74dc","2024-04-14T09:10:18.943+00:00","2024-10-03T19:18:19.497+00:00",[],"Dept-of-Mathematical-Sciences-San-Diego-State-University-San-Diego-USA",{"title":1778},{"EN":1779},"Dept. of Mathematical Sciences, San Diego State University, San Diego, USA",{"openalex":1781,"title":1783},{"VOID":1782},"A5073456642",{"EN":1784},"Robert Grone",{"url":26,"publisher":1786,"properties":1814},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1787,"slug":663,"properties":1788,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1792,"manageAffiliations":1793,"indexDatabases":1794,"url":26,"thumbnailPath":26,"statistic":1809,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1789,"eissn":1790,"title":1791},{"VOID":666},{"VOID":668},{"EN":670},[],[],[1795,1802],{"id":712,"indexDatabase":1796,"url":725,"indexYears":726,"academicFieldIds":1801,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":1797,"label":1798,"description":1799,"key":722,"publicationTags":1800,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":1803,"url":747,"indexYears":26,"academicFieldIds":1808,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":1804,"label":1805,"description":1806,"key":743,"publicationTags":1807,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":1810,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":1811,"totalCitation":757,"totalCitationByYear":1812,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":1813,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"volume":1815,"pages":1817,"issue":1819},{"VOID":1816},"6",{"VOID":1818},"229-237",{"VOID":1820},"3",{"total":359,"publishYear":26,"statisticByYear":1822},{"2012":135,"2013":111,"2014":115,"2015":115,"2016":59,"2017":115,"2019":162,"2020":115,"2021":59,"2022":111,"2023":115},"1990-09-01",1990,[1826,1830,1834,1838,1842,1846,1849,1852,1856,1860,1864,1868,1872,1876,1880,1884,1888,1891,1894,1898],{"id":26,"text":1827,"url":26,"identifiers":1828},"Anderson, W.N. Jr., Morley, T.D.: Eigenvalues of the Laplacian of a graph. Linear and Multilinear Algebra18, 141–145 (1985)",{"doi":1829},"10.1080\u002F03081088508817681",{"id":26,"text":1831,"url":26,"identifiers":1832},"Bapat, R.B.: A bound for the permanent of the Laplacian matrix. Linear Algebra Appl.74, 219–223 (1986)",{"doi":1833},"10.1016\u002F0024-3795(86)90124-2",{"id":26,"text":1835,"url":26,"identifiers":1836},"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, 1974.",{"doi":1837},"10.1017\u002FCBO9780511608704",{"id":26,"text":1839,"url":26,"identifiers":1840},"Brualdi, R.A., Goldwasser, J.L.: Permanent of the Laplacian matrix of trees and bipartite graphs, Discrete Math.48, 1–21 (1984)",{"doi":1841},"10.1016\u002F0012-365X(84)90127-4",{"id":26,"text":1843,"url":26,"identifiers":1844},"Constantine, G.M.: Schur convex functions on the spectra of graphs. Discrete Math.45, 181–188 (1983)",{"doi":1845},"10.1016\u002F0012-365X(83)90034-1",{"id":26,"text":1847,"url":26,"identifiers":1848},"Cvetković, D., Doob, M., Sachs, H.: Spectra of Graphs. New York: Academic Press, 1979",{},{"id":26,"text":1850,"url":26,"identifiers":1851},"Cvetković, D., Doob, M., Gutman, I., Torgasev, A.: Recent Results in the Theory of Graph Spectra. Amsterdam: North-Holland, 1988",{},{"id":26,"text":1853,"url":26,"identifiers":1854},"Dinic, E.A., Kelmans A.K., Zaitsev, M.A.: Nonisomorphic trees with the sameT-polynomial. Inf. Process. Lett.6, 73–76 (1977)",{"doi":1855},"10.1016\u002F0020-0190(77)90029-1",{"id":26,"text":1857,"url":26,"identifiers":1858},"Faria, I.: Permanental roots and the star degree of a graph. Linear Algebra Appl.64, 255–265 (1985)",{"doi":1859},"10.1016\u002F0024-3795(85)90281-2",{"id":26,"text":1861,"url":26,"identifiers":1862},"Fiedler, M.: Algebraic connectivity of graphs. Czech. Math. J.23(98), 298–305 (1973)",{"doi":1863},"10.21136\u002FCMJ.1973.101168",{"id":26,"text":1865,"url":26,"identifiers":1866},"Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czech. Math. J.25(100), 619–633 (1975)",{"doi":1867},"10.21136\u002FCMJ.1975.101357",{"id":26,"text":1869,"url":26,"identifiers":1870},"Forsman, W.: Graph theory and the statistics of polymer chains. J. Chem. Physics65, 4111–4115 (1976)",{"doi":1871},"10.1063\u002F1.432866",{"id":26,"text":1873,"url":26,"identifiers":1874},"Grone R., Merris R.: Algebraic connectivity of trees. Czech. Math. J.37(112), 660–670 (1987)",{"doi":1875},"10.21136\u002FCMJ.1987.102192",{"id":26,"text":1877,"url":26,"identifiers":1878},"Grone, R., Merris, R., Sunder, V.S.: The Laplacian spectrum of a graph, SIAM J. MATRIX ANAL.11 (1990) 218–238.",{"doi":1879},"10.1137\u002F0611016",{"id":26,"text":1881,"url":26,"identifiers":1882},"Hattori, Y.: Nonisomorphic graphs with the sameT-polynomial. Inf. Process. Lett.22, 133–134 (1986)",{"doi":1883},"10.1016\u002F0020-0190(86)90057-8",{"id":26,"text":1885,"url":26,"identifiers":1886},"R. Merris, Characteristic vertices of trees. Linear Multilinear Algebra22, 115–131 (1987)",{"doi":1887},"10.1080\u002F03081088708817827",{"id":26,"text":1889,"url":26,"identifiers":1890},"Mohar, B.: The Laplacian spectrum of graphs. Preprint series dept. math., University E.K. of Ljubljana26, 353–384 (1988)",{},{"id":26,"text":1892,"url":26,"identifiers":1893},"Powers, D.L.: Tree eigenvectors, unpublished.",{},{"id":26,"text":1895,"url":26,"identifiers":1896},"Vrba, A.: The permanent of the Laplacian matrix of a bipartite graph. Czech. Math. J.36(111), 7–17 (1986)",{"doi":1897},"10.21136\u002FCMJ.1986.102059",{"id":26,"text":1899,"url":26,"identifiers":1900},"Vrba, A.: Principal subpermanents of the Laplacian matrix. Linear Multilinear Algebra19, 335–346 (1986)",{"doi":1901},"10.1080\u002F03081088608817728",{"id":1903,"createTime":1904,"updateTime":1905,"relativeEntities":1906,"slug":1907,"properties":1908,"entityType":814,"verifyStatus":25,"verifyTime":1905,"verifyNote":815,"syncStatus":28,"languages":1919,"translateLanguages":26,"viewCount":36,"primaryUrl":1920,"fullTextUrl":26,"authors":1921,"publicationType":839,"publisherRelationship":1944,"citationCount":534,"citationInfo":1980,"publishDate":1982,"publishYear":1983,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1984,"isForceReanalyzing":877},"1a347618-1f28-45de-881e-a9bd6c58b8e9","2024-04-16T16:57:27.212+00:00","2024-12-13T16:27:45.198+00:00",[],"Recent-Advances-on-the-Hamiltonian-Problem-Survey-III",{"mag":1909,"keywords":1911,"openalex":1912,"abstract":1914,"title":1915,"doi":1917},{"VOID":1910},"2036486897",{},{"VOID":1913},"W2036486897",{},{"EN":1916},"Recent Advances on the Hamiltonian Problem: Survey III",{"VOID":1918},"10.1007\u002Fs00373-013-1377-x",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00373-013-1377-x",[1922],{"id":1923,"sortIndex":36,"researcher":26,"roles":1924,"affiliations":1925,"properties":1940},"e46bbb2f-a718-4455-9af6-82d809191f0b",[],[1926],{"id":1927,"sortIndex":36,"affiliation":1928,"properties":1937},"5cebb6cd-a28d-4b16-aadd-082cff3893c7",{"id":1929,"createTime":1930,"updateTime":1931,"relativeEntities":1932,"slug":1933,"properties":1934,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"dfeb4fbc-2c40-488f-be39-866ba80fbcd2","2024-09-02T06:06:01.116+00:00","2024-12-26T14:42:19.007+00:00",[],"Emory-University-Atlanta-United-States",{"title":1935},{"EN":1936},"Emory University, Atlanta, United States",{"title":1938},{"EN":1939},"Emory University, Atlanta, USA",{"openalex":1941,"orcid":1942,"title":1943},{"VOID":834},{"VOID":836},{"EN":838},{"url":26,"publisher":1945,"properties":1973},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1946,"slug":663,"properties":1947,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1951,"manageAffiliations":1952,"indexDatabases":1953,"url":26,"thumbnailPath":26,"statistic":1968,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":1948,"eissn":1949,"title":1950},{"VOID":666},{"VOID":668},{"EN":670},[],[],[1954,1961],{"id":712,"indexDatabase":1955,"url":725,"indexYears":726,"academicFieldIds":1960,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":1956,"label":1957,"description":1958,"key":722,"publicationTags":1959,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":1962,"url":747,"indexYears":26,"academicFieldIds":1967,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":1963,"label":1964,"description":1965,"key":743,"publicationTags":1966,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":1969,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":1970,"totalCitation":757,"totalCitationByYear":1971,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":1972,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"volume":1974,"pages":1976,"issue":1978},{"VOID":1975},"30",{"VOID":1977},"1-46",{"VOID":1979},"1",{"total":534,"publishYear":26,"statisticByYear":1981},{"2014":135,"2015":114,"2016":59,"2017":52,"2018":115,"2019":111,"2020":103,"2021":53,"2022":158,"2023":116,"2024":114},"2014-01-01",2014,[1985,1989,1993,1996,2000,2003,2006,2010,2014,2018,2022,2025,2029,2033,2037,2041,2045,2049,2052,2056,2059,2063,2067,2071,2074,2077,2081,2085,2089,2093,2097,2101,2105,2109,2113,2117,2121,2124,2127,2131,2135,2139,2143,2147,2151,2155,2158,2161,2165,2169,2173,2177,2181,2185,2189,2193,2196,2200,2204,2208,2212,2215,2219,2223,2227,2230,2234,2237,2241,2245,2249,2253,2257,2261,2265,2269,2272,2276,2280,2284,2287,2291,2295,2299,2303,2306,2310,2314,2318,2322,2326,2330,2334,2338,2342,2346,2350,2354,2358,2362,2366,2370,2373,2377,2380,2384,2388,2392,2396,2400,2403,2407,2411,2414,2418,2422,2426,2430,2434,2438,2442,2446,2450,2454,2458,2461,2464,2468,2472,2476,2480,2484,2488,2492,2496,2499,2503,2507,2511,2515,2518,2522,2526,2530,2534,2537,2540,2544,2548,2552,2556,2560,2564,2568,2571,2574,2578,2582,2585,2588,2592,2596,2600,2604,2608,2612,2615,2618,2622,2626,2629,2633,2637,2641,2645,2648,2652,2656,2660,2664,2668,2672,2676,2680,2684,2688,2691,2695,2699,2703,2706,2710,2714,2718,2722,2726,2730,2734,2738,2742,2746,2750,2753,2757,2760,2764,2768,2772,2776,2780,2784,2788],{"id":26,"text":1986,"url":26,"identifiers":1987},"Abderrezzak M.E.K., Flandrin E., Amar D.: Cyclability and pancyclability in bipartite graphs. Discrete Math. 236, 3–11 (2001)",{"doi":1988},"10.1016\u002FS0012-365X(00)00425-8",{"id":26,"text":1990,"url":26,"identifiers":1991},"Abueida A., Sritharan R.: Cycle extendability and Hamiltonian cycles in chordal graph classes. SIAM J. Discrete Math. 20, 669–681 (2006)",{"doi":1992},"10.1137\u002FS0895480104441267",{"id":26,"text":1994,"url":26,"identifiers":1995},"Abueida, A., Busch, A., Sritharan, R.: Hamiltonian spider intersection graphs are cycle extendable (preprint)",{},{"id":26,"text":1997,"url":26,"identifiers":1998},"Ainouche A.: Dirac’s type sufficient conditions for Hamiltonicity and pancyclicity. Graphs Combin. 25, 129–137 (2009)",{"doi":1999},"10.1007\u002Fs00373-008-0835-3",{"id":26,"text":2001,"url":26,"identifiers":2002},"Ainouche A.: Extensions of Bondy’s theorem on cycles in 2-connected graphs. Ars Combin. 85, 385–393 (2007)",{},{"id":26,"text":2004,"url":26,"identifiers":2005},"Ainouche A., Broersma H.J., Veldman H.J.: Remarks on Hamiltonian properties of claw-free graphs. Ars Combin. 29, 110–121 (1990)",{},{"id":26,"text":2007,"url":26,"identifiers":2008},"Ainouche A., Kouider M.: Hamiltonism and partially square graphs. Graphs Combin. 15, 257–265 (1999)",{"doi":2009},"10.1007\u002Fs003730050059",{"id":26,"text":2011,"url":26,"identifiers":2012},"Ainouche A., Lapiquonne S.: Hamiltonian connectedness and partially square graphs. Discrete Math. 306, 1097–1104 (2006)",{"doi":2013},"10.1016\u002Fj.disc.2005.11.021",{"id":26,"text":2015,"url":26,"identifiers":2016},"Ainouche A., Schiermeyer I.: 0-Dual closures for several classes of graphs. Graphs Combin. 19, 297–307 (2003)",{"doi":2017},"10.1007\u002Fs00373-002-0523-y",{"id":26,"text":2019,"url":26,"identifiers":2020},"Alspach B.: Research problem 59. Discrete Math. 50, 115 (1984)",{"doi":2021},"10.1016\u002F0012-365X(84)90041-4",{"id":26,"text":2023,"url":26,"identifiers":2024},"Alspach B.: The wonderful Walecki construction. Bull. Inst. Combin. Appl. 52, 7–20 (2008)",{},{"id":26,"text":2026,"url":26,"identifiers":2027},"Alspach B., Bryant D., Dyer D.: Paley graphs have Hamilton decompositions. Discrete Math. 312, 113–118 (2012)",{"doi":2028},"10.1016\u002Fj.disc.2011.06.003",{"id":26,"text":2030,"url":26,"identifiers":2031},"Bailey R.F., Stevens B.: Hamiltonian decompositions of complete k-uniform hypergraphs. Discrete Math. 310, 3088–3095 (2010)",{"doi":2032},"10.1016\u002Fj.disc.2009.03.047",{"id":26,"text":2034,"url":26,"identifiers":2035},"Babu Ch.S., Diwan A.A.: Subdivisions of graphs: a generalization of paths and cycles. Discrete Math. 308, 4479–4486 (2008)",{"doi":2036},"10.1016\u002Fj.disc.2007.08.045",{"id":26,"text":2038,"url":26,"identifiers":2039},"Bal D., Frieze A.: Packing tight Hamilton cycles in uniform hypergraphs. SIAM J. Discrete Math. 26, 435–451 (2012)",{"doi":2040},"10.1137\u002F11082378X",{"id":26,"text":2042,"url":26,"identifiers":2043},"Balogh J., Bollobás B., Krivelevich M., Müller T., Walters M.: Hamilton cycles in random geometric graphs. Ann. Appl. Probab. 21, 1053–1072 (2011)",{"doi":2044},"10.1214\u002F10-AAP718",{"id":26,"text":2046,"url":26,"identifiers":2047},"Balakrishnan R., Bermond J.-C., Paulraja P., Yu M.-L.: On Hamilton cycle decompositions of the tensor product of complete graphs. Discrete Math. 268, 49–58 (2003)",{"doi":2048},"10.1016\u002FS0012-365X(02)00680-5",{"id":26,"text":2050,"url":26,"identifiers":2051},"Barnette, D.: Conjecture 5. In: Tutte, W. (ed.) Recent Progress in Combinatorics, p. 343. Academic Press, New York (1969)",{},{"id":26,"text":2053,"url":26,"identifiers":2054},"Bauer D., Schmeichel E.: Binding number, minimum degree, and cycle structure in graphs. J. Graph Theory 71, 219–228 (2012)",{"doi":2055},"10.1002\u002Fjgt.21633",{"id":26,"text":2057,"url":26,"identifiers":2058},"Bedrosian, P.: Forbidden subgraphs and minimum degree conditions for Hamiltonicity. Ph.D. Thesis, Memphis State University (1991)",{},{"id":26,"text":2060,"url":26,"identifiers":2061},"Ben-Shimon S., Krivelevich M., Sudakov B.: On the resilience of hamiltonicity and optimal packing of Hamiltonian cycles in random graphs. SIAM J. Discrete Math. 25, 1176–1193 (2011)",{"doi":2062},"10.1137\u002F110821299",{"id":26,"text":2064,"url":26,"identifiers":2065},"Bermond J.-C.: Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Advances in Graph Theory (Cambridge Combinatorial Conference, Trinity College, Cambridge, 1977). Ann. Discrete Math. 3, 21–28 (1978)",{"doi":2066},"10.1016\u002FS0167-5060(08)70494-1",{"id":26,"text":2068,"url":26,"identifiers":2069},"Bermond J.-C.: Problem 97. Discrete Math. 71, 275 (1988)",{"doi":2070},"10.1016\u002F0012-365X(88)90107-0",{"id":26,"text":2072,"url":26,"identifiers":2073},"Bermond J.-C., Germa A., Heydemann M.C., Sotteau D.: Hypergraphes hamiltoniens. Prob. Comb. Théorie Graph Orsay 260, 39–43 (1976)",{},{"id":26,"text":2075,"url":26,"identifiers":2076},"Bian Q., Horn P., Janiszewski S., La Fleur S., Gould R.J., Wrayno P.: 3-connected {K 1,3, P 9 }-free graphs are Hamiltonian connected. Graphs Combin. 313, 2772–2777 (2013)",{},{"id":26,"text":2078,"url":26,"identifiers":2079},"Biebighauser D.P., Ellingham M.N.: Prism-Hamiltonicity of triangulations. J. Graph Theory 57, 181–197 (2008)",{"doi":2080},"10.1002\u002Fjgt.20276",{"id":26,"text":2082,"url":26,"identifiers":2083},"Bloznelis M., Radavičius I.: A note on Hamiltonicity of uniform random intersection graphs. Lith. Math. J. 51, 155–161 (2011)",{"doi":2084},"10.1007\u002Fs10986-011-9115-7",{"id":26,"text":2086,"url":26,"identifiers":2087},"Bohman T., Frieze A.: Hamilton cycles in 3-out. Random Struct. Algorithms 35, 393–417 (2009)",{"doi":2088},"10.1002\u002Frsa.20272",{"id":26,"text":2090,"url":26,"identifiers":2091},"Böhme T., Harant J., Tkáč M.: More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32, 405–410 (1999)",{"doi":2092},"10.1002\u002F(SICI)1097-0118(199912)32:4\u003C405::AID-JGT8>3.0.CO;2-Z",{"id":26,"text":2094,"url":26,"identifiers":2095},"Bondy J.A.: Pancyclic graphs I. J. Combin. Theory Ser. B 11, 80–84 (1971)",{"doi":2096},"10.1016\u002F0095-8956(71)90016-5",{"id":26,"text":2098,"url":26,"identifiers":2099},"Böttcher J., Kohayakawa Y., Procacci A.: Properly colored copies and rainbow copies of large graphs with small maximum degree. Random Struct. Algorithms 40, 425–436 (2012)",{"doi":2100},"10.1002\u002Frsa.20383",{"id":26,"text":2102,"url":26,"identifiers":2103},"Broersma H., Kriesell M., Ryjáček Z.: On factors of 4-connected claw-free graphs. J. Graph Theory 37, 125–136 (2001)",{"doi":2104},"10.1002\u002Fjgt.1008",{"id":26,"text":2106,"url":26,"identifiers":2107},"Broersma H., Faudree R.J., Huck A., Trommel H., Veldman H.J.: Forbidden subgraphs that imply Hamiltonian connectedness. J. Graph Theory 40, 104–119 (2002)",{"doi":2108},"10.1002\u002Fjgt.10034",{"id":26,"text":2110,"url":26,"identifiers":2111},"Broersma H., Ryjacek Z., Vrána P.: How many conjectures can you stand? A survey. Graphs Combin. 28, 57–75 (2012)",{"doi":2112},"10.1007\u002Fs00373-011-1090-6",{"id":26,"text":2114,"url":26,"identifiers":2115},"Broersma H., Xiong L., Yoshimoto K.: Toughness and Hamiltonicity in k-trees. Discrete Math. 307, 832–838 (2007)",{"doi":2116},"10.1016\u002Fj.disc.2005.11.051",{"id":26,"text":2118,"url":26,"identifiers":2119},"Brousek J.: Forbidden triples for Hamiltonicity. Discrete Math. 251, 71–76 (2002)",{"doi":2120},"10.1016\u002FS0012-365X(01)00326-0",{"id":26,"text":2122,"url":26,"identifiers":2123},"Brunet, R., Nakamoto, A., Negami, S.: Every 5-connected triangulation of the Klein bottle is Hamiltonian. In: Proceedings of the 10th Workshop on Topological Graph Theory (Yokohama, 1998) Yokohama Mathematical Journal, vol. 47, pp. 239–244 (1999)",{},{"id":26,"text":2125,"url":26,"identifiers":2126},"Bryant D., Leach C.D., Rodger C.: Hamilton decompositions of complete bipartite graphs with 3-factor leaves. Australas. J. Combin. 31, 331–336 (2005)",{},{"id":26,"text":2128,"url":26,"identifiers":2129},"Butler S., Chung F.: Small spectral gap in the combinatorial Laplacian implies Hamiltonian. Ann. Comb. 13, 403–412 (2010)",{"doi":2130},"10.1007\u002Fs00026-009-0039-4",{"id":26,"text":2132,"url":26,"identifiers":2133},"Čada R., Flandrin E., Li H., Ryjáček Z.: Cycles through given vertices and closures. Discrete Math. 276, 65–80 (2004)",{"doi":2134},"10.1016\u002FS0012-365X(03)00304-2",{"id":26,"text":2136,"url":26,"identifiers":2137},"Chen C.: Any maximal planar graph with only one separating triangle is Hamiltonian. J. Comb. Optim. 7, 79–86 (2003)",{"doi":2138},"10.1023\u002FA:1021998507140",{"id":26,"text":2140,"url":26,"identifiers":2141},"Chen B., Zhang S., Qiao Q.: Hamilton cycles in claw-heavy graphs. Discrete Math. 309, 2015–2019 (2009)",{"doi":2142},"10.1016\u002Fj.disc.2008.04.013",{"id":26,"text":2144,"url":26,"identifiers":2145},"Chen G., Fan G., Yu X.: Cycles in 4-connected planar graphs. Eur. J. Combin. 25, 763–780 (2004)",{"doi":2146},"10.1016\u002Fj.ejc.2003.04.003",{"id":26,"text":2148,"url":26,"identifiers":2149},"Chen G., Faudree R.J., Gould R.J., Jacobson M.S.: Cycle extendability of Hamiltonian interval graphs. SIAM J. Discrete Math. 20, 682–689 (2006)",{"doi":2150},"10.1137\u002FS0895480104441450",{"id":26,"text":2152,"url":26,"identifiers":2153},"Chen G., Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L., Pfender F.: Linear forests and ordered cycles. Discussiones Mathematicae Graph Theory 24, 359–372 (2004)",{"doi":2154},"10.7151\u002Fdmgt.1236",{"id":26,"text":2156,"url":26,"identifiers":2157},"Chen G., Gould R.J.: Hamiltonian connected graphs involving forbidden subgraphs. Bull. Inst. Combin. Appl. 29, 25–32 (2000)",{},{"id":26,"text":2159,"url":26,"identifiers":2160},"Chen G., Gould R.J., Pfender F.: New conditions for k-ordered Hamiltonian graphs. Ars Combin. 70, 245–255 (2004)",{},{"id":26,"text":2162,"url":26,"identifiers":2163},"Christofides D., Kühn D., Osthus D.: Edge-disjoint Hamiltonian cycles in graphs. J. Combin. Theory Ser. B 102, 1035–1060 (2012)",{"doi":2164},"10.1016\u002Fj.jctb.2011.10.005",{"id":26,"text":2166,"url":26,"identifiers":2167},"Chvátal V.: Tough graphs and Hamiltonian circuits. Discrete Math. 5, 215–223 (1973)",{"doi":2168},"10.1016\u002F0012-365X(73)90138-6",{"id":26,"text":2170,"url":26,"identifiers":2171},"Chvátal V., Erdös P.: A note on Hamiltonian circuits. Discrete Math. 2, 111–113 (1972)",{"doi":2172},"10.1016\u002F0012-365X(72)90079-9",{"id":26,"text":2174,"url":26,"identifiers":2175},"Cooper C., Frieze A., Krivelevich M.: Hamilton graphs in random graphs with a fixed degree sequence. SIAM J. Discrete Math. 24, 558–569 (2010)",{"doi":2176},"10.1137\u002F080741379",{"id":26,"text":2178,"url":26,"identifiers":2179},"Cuckler B., Kahn J.: Hamiltonian cycles in Dirac graphs. Combinatorica 29, 299–326 (2009)",{"doi":2180},"10.1007\u002Fs00493-009-2360-2",{"id":26,"text":2182,"url":26,"identifiers":2183},"Cui Q., Hu Y., Wang J.: Long cycles in 4-connected planar graphs. Discrete Math. 309, 1051–1059 (2009)",{"doi":2184},"10.1016\u002Fj.disc.2007.11.059",{"id":26,"text":2186,"url":26,"identifiers":2187},"Diaz J., Mitsche D., Pérez X.: Sharp threshold for Hamiltonicity of random geometric graphs. SIAM J. Discrete Math. 21, 57–65 (2007)",{"doi":2188},"10.1137\u002F060665300",{"id":26,"text":2190,"url":26,"identifiers":2191},"Dirac G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69–81 (1952)",{"doi":2192},"10.1112\u002Fplms\u002Fs3-2.1.69",{"id":26,"text":2194,"url":26,"identifiers":2195},"Dudek, A., Ferrara, M.: Extensions of results on rainbow Hamilton cycles in uniform hypergraphs (preprint)",{},{"id":26,"text":2197,"url":26,"identifiers":2198},"Dudek, A., Frieze, A.: Loose Hamiltonian cycles in random uniform hypergraphs. Electron. J. Combin. 18 (2011), Paper 48",{"doi":2199},"10.37236\u002F535",{"id":26,"text":2201,"url":26,"identifiers":2202},"Dudek A., Frieze A.: Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42, 374–385 (2012)",{"doi":2203},"10.1002\u002Frsa.20404",{"id":26,"text":2205,"url":26,"identifiers":2206},"Dudek, A., Frieze, A., Loh, P.-S., Speiss, S.: Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs. Electron. J. Combin. 19 (2012), Paper 44",{"doi":2207},"10.37236\u002F2523",{"id":26,"text":2209,"url":26,"identifiers":2210},"Dudek, A., Frieze, A., Rucinski, A.: Rainbow Hamilton cycles in uniform hypergraphs. Electron. J. Combin. 19 (2012), Paper 46",{"doi":2211},"10.37236\u002F2055",{"id":26,"text":2213,"url":26,"identifiers":2214},"Duffus, D., Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and the Hamiltonian theme. In: Chartrand, Alavi, Goldsmith, Lesniak, Lick (eds.) The Theory and Applications of Graphs, (Kalmazoo, Mich., 1980), pp. 297–316. Wiley, New York (1981)",{},{"id":26,"text":2216,"url":26,"identifiers":2217},"Egawa Y., Glas R., Locke S.: Cycles and paths through specified vertices in k-connected graphs. J. Combin. Theory Ser. B 52, 20–29 (1991)",{"doi":2218},"10.1016\u002F0095-8956(91)90086-Y",{"id":26,"text":2220,"url":26,"identifiers":2221},"Efthymiou, C., Spitakas, P.G.: On the existence of Hamiltonian cycles in random intersection graphs. Lecture Notes in Computer Science, pp. 690–701. Springer, Berlin (2005)",{"doi":2222},"10.1007\u002F11523468_56",{"id":26,"text":2224,"url":26,"identifiers":2225},"Efthymiou C., Spirakas P.G.: Sharp thresholds for hamiltonicity in random intersection graphs. Theor. Comput. Sci. 411, 3714–3730 (2010)",{"doi":2226},"10.1016\u002Fj.tcs.2010.06.022",{"id":26,"text":2228,"url":26,"identifiers":2229},"Enomoto, H.: Personal communication",{},{"id":26,"text":2231,"url":26,"identifiers":2232},"Fan G.H.: New sufficient condition for cycles in graphs. J. Combin. Theory B 37, 221–227 (1984)",{"doi":2233},"10.1016\u002F0095-8956(84)90054-6",{"id":26,"text":2235,"url":26,"identifiers":2236},"Faudree J.R., Faudree R.J.: Hamiltonian cycles containing ordered linear forests. Bull. Inst. Combin. Appl. 5, 78–104 (2009)",{},{"id":26,"text":2238,"url":26,"identifiers":2239},"Faudree J.R., Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L.: On k-ordered graphs. J. Graph Theory 35, 69–82 (2000)",{"doi":2240},"10.1002\u002F1097-0118(200010)35:2\u003C69::AID-JGT1>3.0.CO;2-I",{"id":26,"text":2242,"url":26,"identifiers":2243},"Faudree J.R., Faudree R.J., Ryjáčk Z., Vrána P.: On forbidden pairs implying Hamilton-connectedness. J. Graph Theory 72, 327–345 (2013)",{"doi":2244},"10.1002\u002Fjgt.21645",{"id":26,"text":2246,"url":26,"identifiers":2247},"Faudree R.J., Gould R.J.: Characterizing forbidden pairs for Hamiltonian properties. Discrete Math. 173, 45–60 (1997)",{"doi":2248},"10.1016\u002FS0012-365X(96)00147-1",{"id":26,"text":2250,"url":26,"identifiers":2251},"Faudree R.J., Gould R.J., Jacobson M.J., Lesniak L.: Characterizing forbidden clawless triples implying Hamiltonian graphs. Discrete Math. 249, 71–81 (2002)",{"doi":2252},"10.1016\u002FS0012-365X(01)00235-7",{"id":26,"text":2254,"url":26,"identifiers":2255},"Faudree R.J., Gould R.J., Jacobson M.S.: Forbidden triples implying hamiltonicity: for all graphs. Discuss. Math. Graph Theory 24, 47–54 (2004)",{"doi":2256},"10.7151\u002Fdmgt.1212",{"id":26,"text":2258,"url":26,"identifiers":2259},"Faudree R.J., Gould R.J., Jacobson M.S.: Potential forbidden triples implying Hamiltonicity: for sufficiently large graphs. Discuss. Math. Graph Theory 25, 273–289 (2005)",{"doi":2260},"10.7151\u002Fdmgt.1281",{"id":26,"text":2262,"url":26,"identifiers":2263},"Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L.: Minimum degree and (k,m)-pancyclic ordered graphs. Graphs Combin. 21, 197–211 (2005)",{"doi":2264},"10.1007\u002Fs00373-005-0604-5",{"id":26,"text":2266,"url":26,"identifiers":2267},"Faudree R.J., Gould R.J., Kostochka A., Lesniak L., Schiermeyer I., Saito A.: Degree conditions for k-ordered Hamiltonian graphs. J. Graph Theory 42, 199–210 (2003)",{"doi":2268},"10.1002\u002Fjgt.10084",{"id":26,"text":2270,"url":26,"identifiers":2271},"Faudree, R.J., Gould, R.J., Jacobson, M.S.: Pancyclic graphs and linear forests. Discrete Math. (2013, to appear)",{},{"id":26,"text":2273,"url":26,"identifiers":2274},"Faudree R.J., Gould R.J., Jacobson M.S., Magnant C.: Distributing vertices on Hamiltonian cycles. J. Graph Theory 69, 28–45 (2012)",{"doi":2275},"10.1002\u002Fjgt.20564",{"id":26,"text":2277,"url":26,"identifiers":2278},"Faudree, R.J., Gould, R.J.: Precise location of vertices on Hamiltonian cycles. Discrete Math. 313(23), 2772–2777 (2013)",{"doi":2279},"10.1016\u002Fj.disc.2013.08.012",{"id":26,"text":2281,"url":26,"identifiers":2282},"Faudree R.J., Gould R.J., Jacobson M.S., Lesniak L.: Generalizing pancyclic and k-ordered graphs. Graphs Combin. 20, 291–309 (2004)",{"doi":2283},"10.1007\u002Fs00373-004-0576-x",{"id":26,"text":2285,"url":26,"identifiers":2286},"Faudree, R.J., Lehel, J., Yoshimoto, K.: A note on locating pairs of vertices on a Hamiltonian cycle (preprint)",{},{"id":26,"text":2288,"url":26,"identifiers":2289},"Favaron O., Flandrin E., Li H., Tian F.: An Ore-type condition for pancyclability. Discrete Math. 206, 139–144 (1999)",{"doi":2290},"10.1016\u002FS0012-365X(98)00399-9",{"id":26,"text":2292,"url":26,"identifiers":2293},"Ferrara M., Gould R.J., Jacobson M.S., Pfender F., Powell J., Whalen T.: New Ore-type conditions for H-linked graphs. J. Graph Theory 71, 69–77 (2012)",{"doi":2294},"10.1002\u002Fjgt.20632",{"id":26,"text":2296,"url":26,"identifiers":2297},"Ferrara M., Gould R.J., Tansey G., Whalen T.: Disjoint Hamiltonian cycles in bipartite graphs. Discrete Math. 309, 3811–3820 (2009)",{"doi":2298},"10.1016\u002Fj.disc.2008.10.026",{"id":26,"text":2300,"url":26,"identifiers":2301},"Ferrara M., Gould R.J., Tansey G., Whalen T.: On H-linked graphs. Graphs Combin. 22, 217–224 (2006)",{"doi":2302},"10.1007\u002Fs00373-006-0651-6",{"id":26,"text":2304,"url":26,"identifiers":2305},"Ferrara M., Jacobson M.S., Harlan A.: Hamiltonian cycles avoiding sets of edges in a graph. Australas. J. Combin. 48, 191–203 (2010)",{},{"id":26,"text":2307,"url":26,"identifiers":2308},"Ferrara M., Magnant C., Powell J.: Pan-H-linked graphs. Graphs Combin. 26, 225–242 (2010)",{"doi":2309},"10.1007\u002Fs00373-010-0911-3",{"id":26,"text":2311,"url":26,"identifiers":2312},"Fiedler M., Nikiforov V.: Spectral radius and hamiltonicity of graphs. Linear Algebra Appl. 432, 2170–2173 (2010)",{"doi":2313},"10.1016\u002Fj.laa.2009.01.005",{"id":26,"text":2315,"url":26,"identifiers":2316},"Flandrin E., Li H., Marczyk A., Wožniak M.: A note on pancyclism of highly connected graphs. Discrete Math. 286, 57–60 (2004)",{"doi":2317},"10.1016\u002Fj.disc.2003.11.045",{"id":26,"text":2319,"url":26,"identifiers":2320},"Florek J.: On Barnette’s conjecture. Discrete Math. 310, 1531–1535 (2010)",{"doi":2321},"10.1016\u002Fj.disc.2010.01.018",{"id":26,"text":2323,"url":26,"identifiers":2324},"Frankl P., Katona Gy.Y.: Extremal k-edge Hamiltonian hypergraphs. Discrete Math. 308, 1415–1424 (2008)",{"doi":2325},"10.1016\u002Fj.disc.2007.07.074",{"id":26,"text":2327,"url":26,"identifiers":2328},"Frieze, A.: Loose Hamilton cycles in random 3-uniform hypergraphs. Electron. J. Combin. 17, #N283 (2010)",{"doi":2329},"10.37236\u002F477",{"id":26,"text":2331,"url":26,"identifiers":2332},"Frieze A., Krivelevich M.: On packing Hamilton cycles in ε-regular graphs. J. Combin. Theory B 94, 159–172 (2005)",{"doi":2333},"10.1016\u002Fj.jctb.2004.12.003",{"id":26,"text":2335,"url":26,"identifiers":2336},"Frieze A., Krivelevich M., Loh P.-S.: Packing tight Hamilton cycles in 3-uniform hypergraphs. Random Struct. Algorithms 40, 269–300 (2012)",{"doi":2337},"10.1002\u002Frsa.20374",{"id":26,"text":2339,"url":26,"identifiers":2340},"Fujisawa J., Ota K., Sugiyama T., Tsugaki M.: Forbidden subgraphs and the existence of paths and cycles through specified vertices. Discrete Math. 308, 6111–6114 (2008)",{"doi":2341},"10.1016\u002Fj.disc.2007.11.033",{"id":26,"text":2343,"url":26,"identifiers":2344},"Fujisawa J., Nakamoto A., Ozeki K.: Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices. J. Combin. Theory B 103, 46–60 (2013)",{"doi":2345},"10.1016\u002Fj.jctb.2012.08.004",{"id":26,"text":2347,"url":26,"identifiers":2348},"Fujisawa J., Yamashita T.: Degree conditions on claws and modified claws for hamiltonicity of graphs. Discrete Math. 308, 1612–1619 (2008)",{"doi":2349},"10.1016\u002Fj.disc.2007.04.018",{"id":26,"text":2351,"url":26,"identifiers":2352},"Gerlach T.: Toughness and hamiltonicity of a class of planar graphs. Discrete Math. 286, 61–65 (2004)",{"doi":2353},"10.1016\u002Fj.disc.2003.11.046",{"id":26,"text":2355,"url":26,"identifiers":2356},"Glebov R., Krivelevich M.: On the number of Hamilton cycles in sparse random graphs. SIAM J. Discrete Math. 27, 27–42 (2013)",{"doi":2357},"10.1137\u002F120884316",{"id":26,"text":2359,"url":26,"identifiers":2360},"Glebov R., Person Y., Weps W.: On extremal hypergraphs for Hamiltonian cycles. Eur. J. Combin. 33, 544–555 (2012)",{"doi":2361},"10.1016\u002Fj.ejc.2011.10.003",{"id":26,"text":2363,"url":26,"identifiers":2364},"Goddard W.: Minimum degree conditions for cycles including specified sets of vertices. Graphs Combin. 20, 467–483 (2004)",{"doi":2365},"10.1007\u002Fs00373-004-0565-0",{"id":26,"text":2367,"url":26,"identifiers":2368},"Gould R.J.: Updating the Hamiltonian problem—a survey. J. Graph Theory 15, 121–157 (1991)",{"doi":2369},"10.1002\u002Fjgt.3190150204",{"id":26,"text":2371,"url":26,"identifiers":2372},"Gould R.J.: Advances on the Hamiltonian problem—a survey. Graphs Combin. 19, 7–52 (2003)",{"doi":813},{"id":26,"text":2374,"url":26,"identifiers":2375},"Gould R.J.: A look at cycles containing specified elements of a graph. Discrete Math. 309, 6299–6311 (2009)",{"doi":2376},"10.1016\u002Fj.disc.2008.04.017",{"id":26,"text":2378,"url":26,"identifiers":2379},"Gould, R.J.: Graph Theory, Dover Publications, Inc., Mineola (2012)",{},{"id":26,"text":2381,"url":26,"identifiers":2382},"Gould R.J., Luczak T., Pfender F.: Pancyclicity of 3-connected graphs: pairs of forbidden subgraphs. J. Graph Theory 47, 183–202 (2004)",{"doi":2383},"10.1002\u002Fjgt.20030",{"id":26,"text":2385,"url":26,"identifiers":2386},"Gould R.J., Kostochka A., Yu G.: On minimum degree implying that a graph is H-linked. SIAM J. Discrete Math. 20, 829–840 (2006)",{"doi":2387},"10.1137\u002F050624662",{"id":26,"text":2389,"url":26,"identifiers":2390},"Gould R.J., Whalen T.: Subdivision extendibility. Graphs Combin. 23, 165–182 (2007)",{"doi":2391},"10.1007\u002Fs00373-006-0665-0",{"id":26,"text":2393,"url":26,"identifiers":2394},"Greenhill C., Kim J.H., Wormald N.: Hamiltonian decompositions of random bipartite regular graphs. J. Combin. Theory Ser. B 90, 195–222 (2004)",{"doi":2395},"10.1016\u002Fj.jctb.2003.07.001",{"id":26,"text":2397,"url":26,"identifiers":2398},"Grünbaum B.: Polytopes graphs and complexes. Bull. Am. Math. Soc. 76, 1131–1201 (1970)",{"doi":2399},"10.1090\u002FS0002-9904-1970-12601-5",{"id":26,"text":2401,"url":26,"identifiers":2402},"Häggkvist, R.: On F-Hamiltonian graphs. In: Bondy, J.A., Murty, U.S.R. (eds) Graphs and Related Topics, pp. 219–231. Academic Press, New York (1979)",{},{"id":26,"text":2404,"url":26,"identifiers":2405},"Hán H., Schacht M.: Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Combin. Theory B 100, 332–346 (2010)",{"doi":2406},"10.1016\u002Fj.jctb.2009.10.002",{"id":26,"text":2408,"url":26,"identifiers":2409},"Harkat-Benhamdine A., Li H., Tian F.: Cyclability of 3-connected graphs. J. Graph Theory 34, 191–203 (2000)",{"doi":2410},"10.1002\u002F1097-0118(200007)34:3\u003C191::AID-JGT1>3.0.CO;2-V",{"id":26,"text":2412,"url":26,"identifiers":2413},"Hartke, S., Seacrest, T.: Random partitions and edge disjoint Hamiltonian cycles (preprint)",{},{"id":26,"text":2415,"url":26,"identifiers":2416},"Helden G.: Each maximal planar graph with exactly two separating triangles is Hamiltonian. Discrete Appl. Math. 155, 1833–1836 (2007)",{"doi":2417},"10.1016\u002Fj.dam.2007.03.018",{"id":26,"text":2419,"url":26,"identifiers":2420},"Helden, G., Vieten, O.: Hamiltonian cycles in maximal planar graphs. In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization 71, Electronic Notes in Discrete Mathematics, vol. 25, Elsevier, Amsterdam (2006)",{"doi":2421},"10.1016\u002Fj.endm.2006.06.092",{"id":26,"text":2423,"url":26,"identifiers":2424},"Holton D.L., Manvel B., McKay B.D.: Hamiltonian cycles in cubic 3-connected bipartite graphs. J. Combin. Theory B 38, 279–297 (1985)",{"doi":2425},"10.1016\u002F0095-8956(85)90072-3",{"id":26,"text":2427,"url":26,"identifiers":2428},"Hu Z., Tian F., Bing W.: Hamiltonian connectivity of line graphs and claw-free graphs. J. Graph Theory 50, 130–141 (2005)",{"doi":2429},"10.1002\u002Fjgt.20099",{"id":26,"text":2431,"url":26,"identifiers":2432},"Jackson B.: Edge-disjoint Hamiltonian cycles in regular graphs of large degree. J. Lond. Math. Soc. 19, 13–16 (1979)",{"doi":2433},"10.1112\u002Fjlms\u002Fs2-19.1.13",{"id":26,"text":2435,"url":26,"identifiers":2436},"Jiang T.: Planar Hamiltonian chordal graphs are cycle extendable. Discrete Math. 257, 441–444 (2002)",{"doi":2437},"10.1016\u002FS0012-365X(02)00505-8",{"id":26,"text":2439,"url":26,"identifiers":2440},"Kaiser T., Kriesell M.: On the pancyclicity of lexicographic products. Graphs Combin. 22, 51–58 (2006)",{"doi":2441},"10.1007\u002Fs00373-005-0639-7",{"id":26,"text":2443,"url":26,"identifiers":2444},"Kaiser T., Vrána P.: Hamilton cycles in 5-connected line graphs. Eur. J. Combin. 33, 924–947 (2012)",{"doi":2445},"10.1016\u002Fj.ejc.2011.09.015",{"id":26,"text":2447,"url":26,"identifiers":2448},"Kaneko A., Yoshimoto K.: On a Hamiltonian cycle in which specified vertices are uniformly distributed. J. Combin. Theory Ser. B 81, 100–109 (2001)",{"doi":2449},"10.1006\u002Fjctb.2000.1999",{"id":26,"text":2451,"url":26,"identifiers":2452},"Karoński M., Scheinerman E., Singer-Cohen K.: On random intersection graphs: the subgraph problem. Combin. Prob. Comput. 8, 131–159 (1999)",{"doi":2453},"10.1017\u002FS0963548398003459",{"id":26,"text":2455,"url":26,"identifiers":2456},"Katona G.Y., Kierstead H.: Hamiltonian chains in hypergraphs. J. Graph Theory 30, 205–212 (1999)",{"doi":2457},"10.1002\u002F(SICI)1097-0118(199903)30:3\u003C205::AID-JGT5>3.0.CO;2-O",{"id":26,"text":2459,"url":26,"identifiers":2460},"Kawarabayashi K.: A survey on Hamiltonian cycles. Interdiscip. Inf. Sci. 7, 25–39 (2001)",{},{"id":26,"text":2462,"url":26,"identifiers":2463},"Keevash P.: A hypergraph blow-up lemma. Random Struct. Algorithms 39, 275–376 (2013)",{},{"id":26,"text":2465,"url":26,"identifiers":2466},"Keevash P., Kühn D., Mycroft R., Osthus D.: Loose Hamilton cycles in hypergraphs. Discrete Math. 311, 544–559 (2011)",{"doi":2467},"10.1016\u002Fj.disc.2010.11.013",{"id":26,"text":2469,"url":26,"identifiers":2470},"Kierstead H., Sárközy G., Selkow S.: On k-ordered Hamiltonian graphs. J. Graph Theory 32, 17–25 (1999)",{"doi":2471},"10.1002\u002F(SICI)1097-0118(199909)32:1\u003C17::AID-JGT2>3.0.CO;2-G",{"id":26,"text":2473,"url":26,"identifiers":2474},"Knox F., Kühn D., Osthus D.: Approximate Hamilton decompositions of random graphs. Random Struct. Algorithms 40, 133–149 (2012)",{"doi":2475},"10.1002\u002Frsa.20365",{"id":26,"text":2477,"url":26,"identifiers":2478},"Kostochka A., Yu G.: An extremal problem for H-linked graphs. J. Graph Theory 50, 321–339 (2005)",{"doi":2479},"10.1002\u002Fjgt.20115",{"id":26,"text":2481,"url":26,"identifiers":2482},"Kriesell M.: All 4-connected line graphs of claw-free graphs are Hamiltonian connected. J. Combin. Theory B 82, 306–315 (2001)",{"doi":2483},"10.1006\u002Fjctb.2001.2040",{"id":26,"text":2485,"url":26,"identifiers":2486},"Krivelevich, M.: On the number of Hamilton cycles in pseudo-random graphs. Electron. J. Combin. 19 (2012), Paper 24",{"doi":2487},"10.37236\u002F1177",{"id":26,"text":2489,"url":26,"identifiers":2490},"Krivelevich M., Samotij W.: Optimal packings of Hamilton cycles in sparse random graphs. SIAM J. Discrete Math. 26, 964–982 (2012)",{"doi":2491},"10.1137\u002F110849171",{"id":26,"text":2493,"url":26,"identifiers":2494},"Krivelevich M., Sudakov B.: Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory 42, 17–33 (2003)",{"doi":2495},"10.1002\u002Fjgt.10065",{"id":26,"text":2497,"url":26,"identifiers":2498},"Kronk H.: A generalization of a theorem of Pósa. Proc. Am. Math. Soc. 21, 77–78 (1969)",{},{"id":26,"text":2500,"url":26,"identifiers":2501},"Kühn D., Lapinskas J., Osthus D.: Optimal packings of Hamilton cycles in graphs of high minimum degree. Combin. Prob. Comput. 22, 394–416 (2013)",{"doi":2502},"10.1017\u002FS0963548312000569",{"id":26,"text":2504,"url":26,"identifiers":2505},"Kühn D., Osthus D.: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory Ser. B 96, 767–821 (2006)",{"doi":2506},"10.1016\u002Fj.jctb.2006.02.004",{"id":26,"text":2508,"url":26,"identifiers":2509},"Kühn D., Osthus D.: Hamilton decompositions of regular expanders: a proof of Kelly’s conjecture for large tournaments. Adv. Math. 237, 62–146 (2013)",{"doi":2510},"10.1016\u002Fj.aim.2013.01.005",{"id":26,"text":2512,"url":26,"identifiers":2513},"Kühn D., Osthus D.: A survey on Hamilton cycles in directed graphs. Eur. J. Combin. 33, 750–766 (2012)",{"doi":2514},"10.1016\u002Fj.ejc.2011.09.030",{"id":26,"text":2516,"url":26,"identifiers":2517},"Kuipers, E.J., Veldman, H.: Recognizing claw-free Hamiltonian graphs with large minimum degree. Memo, 1437, Department of Applied Mathematics, University of Twente, Enschede (1998)",{},{"id":26,"text":2519,"url":26,"identifiers":2520},"Lai H.-J., Shao Y., Yu G., Zhan M.: Hamiltonian connectedness in 3-connected line graphs. Discrete Appl. Math. 157, 982–990 (2009)",{"doi":2521},"10.1016\u002Fj.dam.2008.02.005",{"id":26,"text":2523,"url":26,"identifiers":2524},"Lai H.-J., Shao Y., Zhan M.: Hamiltonicity in 3-connected claw-free graphs. J. Combin. Theory B 96, 493–504 (2006)",{"doi":2525},"10.1016\u002Fj.jctb.2005.10.003",{"id":26,"text":2527,"url":26,"identifiers":2528},"Lai H.-J., Shao Y., Zhan M.: Every 4-connected line graph of a quasi-claw-free graph is Hamiltonian connected. Discrete Math. 308, 5312–5316 (2008)",{"doi":2529},"10.1016\u002Fj.disc.2007.09.045",{"id":26,"text":2531,"url":26,"identifiers":2532},"Lai H.-J., Xiong L., Yan H., Yan J.: Every 3-connected claw-free Z 8-free graph is Hamiltonian. J. Graph Theory 64, 1–11 (2010)",{"doi":2533},"10.1002\u002Fjgt.20433",{"id":26,"text":2535,"url":26,"identifiers":2536},"Lafond, M., Seamone, B.: Some Hamiltonian chordal graphs are not cycle extendable (preprint)",{},{"id":26,"text":2538,"url":26,"identifiers":2539},"Las Vergnas, M.: Thesis, University of Paris, Paris (1972)",{},{"id":26,"text":2541,"url":26,"identifiers":2542},"Leach C.D., Rodger C.: Hamilton decompositions of complete graphs with 3-factor leaves. Discrete Math. 279, 337–344 (2004)",{"doi":2543},"10.1016\u002FS0012-365X(03)00281-4",{"id":26,"text":2545,"url":26,"identifiers":2546},"Leach C.D., Rodger C.: Hamilton decompositions of complete multipartite graphs with any 2-factor leave. J. Graph Theory 44, 208–214 (2003)",{"doi":2547},"10.1002\u002Fjgt.10142",{"id":26,"text":2549,"url":26,"identifiers":2550},"Lee C., Sudakov B.: Dirac’s theorem for random graphs. Random Struct. Algorithms 41, 293–305 (2012)",{"doi":2551},"10.1002\u002Frsa.20419",{"id":26,"text":2553,"url":26,"identifiers":2554},"Li G., Lu M., Liu Z.: Hamiltonian cycles in 3-connected claw-free graphs. Discrete Math. 250, 137–151 (2002)",{"doi":2555},"10.1016\u002FS0012-365X(01)00279-5",{"id":26,"text":2557,"url":26,"identifiers":2558},"Li R.: Hamiltonicity of 3-connected quasi-claw-free graphs. Discrete Math. 265, 393–399 (2003)",{"doi":2559},"10.1016\u002FS0012-365X(02)00882-8",{"id":26,"text":2561,"url":26,"identifiers":2562},"Li R., Schelp R.: Every 3-connected distance claw-free graph is Hamiltonian connected. Discrete Math. 268, 185–197 (2003)",{"doi":2563},"10.1016\u002FS0012-365X(02)00687-8",{"id":26,"text":2565,"url":26,"identifiers":2566},"Li M., Chen X., Broersma H.: Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. J. Graph Theory 68, 285–298 (2011)",{"doi":2567},"10.1002\u002Fjgt.20558",{"id":26,"text":2569,"url":26,"identifiers":2570},"Li J., Shen R., Tian F.: Cycles containing given subsets in 1-tough graphs. Ars Combin. 58, 193–204 (2001)",{},{"id":26,"text":2572,"url":26,"identifiers":2573},"Li M.: Hamiltonian connected claw-free graphs. Graphs Combin. 20, 341–362 (2004)",{},{"id":26,"text":2575,"url":26,"identifiers":2576},"Lu, L., Székely, L.: Using Lovász local lemma in the space of random injections. Electron. J. Combin. 14, 13 (2007) Paper 63",{"doi":2577},"10.37236\u002F981",{"id":26,"text":2579,"url":26,"identifiers":2580},"Luczak T., Pfender F.: Claw-free 3-connected P 11-free graphs are Hamiltonian. J. Graph Theory 47, 111–121 (2004)",{"doi":2581},"10.1002\u002Fjgt.20019",{"id":26,"text":2583,"url":26,"identifiers":2584},"Malkevitch, J.: Polytopal graphs. In: Beineke, Wilson (eds.) Selected Topics in Graph Theory, vol. 3. Academic Press, New York, pp. 169–188 (1988)",{},{"id":26,"text":2586,"url":26,"identifiers":2587},"Manikandan R.S., Paulraja P.: Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph. Ars Combin. 80, 33–44 (2006)",{},{"id":26,"text":2589,"url":26,"identifiers":2590},"Manikandan R.S., Paulraja P.: Hamilton cycle decompositions of the tensor product of complete multipartite graphs. Discrete Math. 308, 3586–3606 (2008)",{"doi":2591},"10.1016\u002Fj.disc.2007.07.020",{"id":26,"text":2593,"url":26,"identifiers":2594},"Matthews M., Sumner D.: Hamiltonian results in K 1,3-free graphs. J. Graph Theory 8, 139–146 (1984)",{"doi":2595},"10.1002\u002Fjgt.3190080116",{"id":26,"text":2597,"url":26,"identifiers":2598},"Mohar B.: A domain monotonicity theorem for graphs and hamiltonicity. Discrete Appl. Math. 36, 169–177 (1992)",{"doi":2599},"10.1016\u002F0166-218X(92)90230-8",{"id":26,"text":2601,"url":26,"identifiers":2602},"Moon J., Moser L.: On Hamiltonian bipartite graphs. Isr. J. Math. 1, 163–165 (1963)",{"doi":2603},"10.1007\u002FBF02759704",{"id":26,"text":2605,"url":26,"identifiers":2606},"Müller T., Pérez-Giménez X., Wormald N.: Disjoint Hamilton cycles in the random geometric graph. J. Graph Theory 68, 299–322 (2011)",{"doi":2607},"10.1002\u002Fjgt.20560",{"id":26,"text":2609,"url":26,"identifiers":2610},"Nakamoto A., Ozeki K.: Hamiltonian cycles in bipartite quadrangulations on the torus. J. Graph Theory 69, 143–151 (2012)",{"doi":2611},"10.1002\u002Fjgt.20569",{"id":26,"text":2613,"url":26,"identifiers":2614},"Nash-Williams, C.St.J.A.: Edge-Disjoint Hamiltonian Circuits in Graphs Having Sufficiently Large Valencies. Studies in Pure Mathematics. Academic Press, London, pp. 157–183 (1971)",{},{"id":26,"text":2616,"url":26,"identifiers":2617},"Nash-Williams, C.St.J.A.: Unexplored and Semi-Explored Territories in Graph Theory. New Directions in Graph Theory. Academic Press, New York, pp. 169–176 (1973)",{},{"id":26,"text":2619,"url":26,"identifiers":2620},"Nikoletseas S., Raptopoulos C., Spitakis P.G.: On the independence number and Hamiltonicity of uniform random intersection graphs. Theor. Comput. Sci. 412, 6750–6760 (2011)",{"doi":2621},"10.1016\u002Fj.tcs.2011.09.003",{"id":26,"text":2623,"url":26,"identifiers":2624},"Ng L., Schultz M.: k-ordered Hamiltonian graphs. J. Graph Theory 24, 45–57 (1997)",{"doi":2625},"10.1002\u002F(SICI)1097-0118(199701)24:1\u003C45::AID-JGT6>3.0.CO;2-J",{"id":26,"text":2627,"url":26,"identifiers":2628},"Okol’nishnikova E.A.: On the number of Hamiltonian cycles in dense Hamiltonian graphs. (Russ.) Mat. Tr. 8, 199–206 (2005)",{},{"id":26,"text":2630,"url":26,"identifiers":2631},"Ore, O.: A note on Hamiltonian circuits. Am. Math. Mon. 67, 55 (1960)",{"doi":2632},"10.2307\u002F2308928",{"id":26,"text":2634,"url":26,"identifiers":2635},"Perez Reilly, E., Scheinerman, E.: Random threshold graphs. Electron. J. Combin. 16, Paper 130 (2009)",{"doi":2636},"10.37236\u002F219",{"id":26,"text":2638,"url":26,"identifiers":2639},"Pfender F.: Hamiltonicity and forbidden subgraphs in 4-connected graphs. J. Graph Theory 49, 262–272 (2005)",{"doi":2640},"10.1002\u002Fjgt.20080",{"id":26,"text":2642,"url":26,"identifiers":2643},"Pike D.A.: Hamilton decompositions of line graphs of some bipartite graph. Discuss. Math. Graph Theory 25, 303–310 (2005)",{"doi":2644},"10.7151\u002Fdmgt.1283",{"id":26,"text":2646,"url":26,"identifiers":2647},"Pósa L.: On the circuits of finite graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 8, 355–361 (1963)",{},{"id":26,"text":2649,"url":26,"identifiers":2650},"Qiao S., Zhang S.: Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs. Graphs Combin. 28, 277–285 (2012)",{"doi":2651},"10.1007\u002Fs00373-011-1042-1",{"id":26,"text":2653,"url":26,"identifiers":2654},"Robinson R.W., Wormald N.: Almost all regular graphs are Hamiltonian. Random Struct. Algorithms 5, 363–374 (1994)",{"doi":2655},"10.1002\u002Frsa.3240050209",{"id":26,"text":2657,"url":26,"identifiers":2658},"Rodger C.: Hamiltonian decomposable graphs with specified leaves. Graphs Combin. 20, 541–543 (2004)",{"doi":2659},"10.1007\u002Fs00373-004-0573-0",{"id":26,"text":2661,"url":26,"identifiers":2662},"Rödl V., Rucinski A., Szemerédi E.: A Dirac-type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15, 229–251 (2006)",{"doi":2663},"10.1017\u002FS0963548305007042",{"id":26,"text":2665,"url":26,"identifiers":2666},"Rödl V., Rucinski A., Szemerédi E.: An approximate Dirac-type theorem for k-uniform hypergraphs. Combinatorica 28(2), 229–260 (2008)",{"doi":2667},"10.1007\u002Fs00493-008-2295-z",{"id":26,"text":2669,"url":26,"identifiers":2670},"Rödl V., Ruciński A., Szemerédi E.: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Adv. Math. 227, 1225–1229 (2011)",{"doi":2671},"10.1016\u002Fj.aim.2011.03.007",{"id":26,"text":2673,"url":26,"identifiers":2674},"Rosenfeld M., Barnette D.: Hamiltonian circuits in certain prisms. Discrete Math. 5, 389–394 (1973)",{"doi":2675},"10.1016\u002F0012-365X(73)90132-5",{"id":26,"text":2677,"url":26,"identifiers":2678},"Ryjáček Z.: On a closure concept in claw-free graphs. J. Combin. Theory B 70, 217–224 (1997)",{"doi":2679},"10.1006\u002Fjctb.1996.1732",{"id":26,"text":2681,"url":26,"identifiers":2682},"Ryjáček Z., Vrána P.: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs. J. Graph Theory 66, 152–173 (2011)",{"doi":2683},"10.1002\u002Fjgt.20498",{"id":26,"text":2685,"url":26,"identifiers":2686},"Rybarczyk, K.: Sharp threshold functions for random intersection graphs via a coupling method. Electron. J. Combin. 18, Paper 36 (2011)",{"doi":2687},"10.37236\u002F523",{"id":26,"text":2689,"url":26,"identifiers":2690},"Sakai T.: Long paths and cycles through specified vertices in k-connected graphs. Ars Combin. 58, 33–65 (2001)",{},{"id":26,"text":2692,"url":26,"identifiers":2693},"Sanders D.P.: On paths in planar graphs. J. Graph Theory 24, 341–345 (1997)",{"doi":2694},"10.1002\u002F(SICI)1097-0118(199704)24:4\u003C341::AID-JGT6>3.0.CO;2-O",{"id":26,"text":2696,"url":26,"identifiers":2697},"Sárkozy G., Selkow S., Szemerédi E.: On the number of Hamiltonian cycles in Dirac graphs. Discrete Math. 265, 237–250 (2003)",{"doi":2698},"10.1016\u002FS0012-365X(02)00582-4",{"id":26,"text":2700,"url":26,"identifiers":2701},"Sárkozy G., Selkow S.: Distributing vertices along a Hamiltonian cycle in Dirac graphs. Discrete Math. 308, 5757–5770 (2008)",{"doi":2702},"10.1016\u002Fj.disc.2007.10.042",{"id":26,"text":2704,"url":26,"identifiers":2705},"Sciriha I., Cardoso D.M.: Necessary and sufficient conditions for a Hamiltonian graph. J. Combin. Math. Combin. Comput. 80, 127–150 (2012)",{},{"id":26,"text":2707,"url":26,"identifiers":2708},"Shepherd F.B.: Hamiltonicity in claw-free graphs. J. Combin. Theory B 53, 173–194 (1991)",{"doi":2709},"10.1016\u002F0095-8956(91)90074-T",{"id":26,"text":2711,"url":26,"identifiers":2712},"Skupien Z.: Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. Discrete Math. 309, 6382–6390 (2009)",{"doi":2713},"10.1016\u002Fj.disc.2008.11.003",{"id":26,"text":2715,"url":26,"identifiers":2716},"Sudakov B., Vu V.: Local resilience of graphs. Random Struct. Algorithms 33, 409–433 (2008)",{"doi":2717},"10.1002\u002Frsa.20235",{"id":26,"text":2719,"url":26,"identifiers":2720},"Sugiyama T.: Hamiltonian cycles through a linear forest. Sut. J. Math. 40, 103–109 (2004)",{"doi":2721},"10.55937\u002Fsut\u002F1108749122",{"id":26,"text":2723,"url":26,"identifiers":2724},"Tait, P.G.: Remark on the coloring of maps. Proc. R. Soc. Edinb. 10, 729 (1880)",{"doi":2725},"10.1017\u002FS0370164600044643",{"id":26,"text":2727,"url":26,"identifiers":2728},"Thomas R., Yu X.: 4-connected projective planar graphs are Hamiltonian. J. Combin. Theory B 62, 114–132 (1994)",{"doi":2729},"10.1006\u002Fjctb.1994.1058",{"id":26,"text":2731,"url":26,"identifiers":2732},"Thomas R., Yu X.: Five-connected toroidal graphs are Hamiltonian. J. Combin. Theory B 69, 79–96 (1997)",{"doi":2733},"10.1006\u002Fjctb.1996.1713",{"id":26,"text":2735,"url":26,"identifiers":2736},"Thomas R., Yu X., Zang W.: Hamilton paths in toroidal graphs. J. Combin. Theory B 94, 214–236 (2005)",{"doi":2737},"10.1016\u002Fj.jctb.2005.01.002",{"id":26,"text":2739,"url":26,"identifiers":2740},"Thomassen C.: A theorem on paths in planar graphs. J. Graph Theory 9, 169–176 (1983)",{"doi":2741},"10.1002\u002Fjgt.3190070205",{"id":26,"text":2743,"url":26,"identifiers":2744},"Thomason A.G.: Hamiltonian cycles and uniquely edge colorable graphs. Ann. Discrete Math. 3, 259–268 (1978)",{"doi":2745},"10.1016\u002FS0167-5060(08)70511-9",{"id":26,"text":2747,"url":26,"identifiers":2748},"Thomassen C.: Reflections on graph theory. J. Graph Theory 10, 309–324 (1986)",{"doi":2749},"10.1002\u002Fjgt.3190100308",{"id":26,"text":2751,"url":26,"identifiers":2752},"Tian F., Wei B.: Pancyclicity mod k of K 1,4-free graphs. Adv. Math. (China) 34, 221–232 (2005)",{},{"id":26,"text":2754,"url":26,"identifiers":2755},"Tutte W.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 309–324 (1956)",{"doi":2756},"10.1090\u002FS0002-9947-1956-0081471-8",{"id":26,"text":2758,"url":26,"identifiers":2759},"Tuza Z.: Steiner system and large non-Hamiltonian hypergraphs. Matematiche 61, 179–183 (2006)",{},{"id":26,"text":2761,"url":26,"identifiers":2762},"van den Heuvel, J.: Hamilton cycles and eigenvalues of graphs. Linear Algebra Appl. 226–228, 723–730 (1995)",{"doi":2763},"10.1016\u002F0024-3795(95)00254-O",{"id":26,"text":2765,"url":26,"identifiers":2766},"Verrall H.: Hamiltonian decompositions of complete 3-uniform hypergraphs. Discrete Math. 132, 333–348 (1994)",{"doi":2767},"10.1016\u002F0012-365X(92)00572-9",{"id":26,"text":2769,"url":26,"identifiers":2770},"Westland E., Liu J., Kreher D.: 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable. Discrete Math. 309, 5106–5110 (2009)",{"doi":2771},"10.1016\u002Fj.disc.2009.03.043",{"id":26,"text":2773,"url":26,"identifiers":2774},"Whitney H.: A theorem on graphs. Ann. Math. 32, 378–390 (1931)",{"doi":2775},"10.2307\u002F1968197",{"id":26,"text":2777,"url":26,"identifiers":2778},"Witte D., Gallian J.: A survey: Hamiltonian cycles in Cayley graphs. Discrete Math. 51, 293–304 (1984)",{"doi":2779},"10.1016\u002F0012-365X(84)90010-4",{"id":26,"text":2781,"url":26,"identifiers":2782},"Yang Z.: Note on F-Hamiltonian graphs. Discrete Math. 196, 281–286 (1999)",{"doi":2783},"10.1016\u002FS0012-365X(98)00216-7",{"id":26,"text":2785,"url":26,"identifiers":2786},"Yu X.: Disjoint paths, planarizing cycles, and spanning walks. Trans. Am. Math. Soc. 349, 1333–1358 (1997)",{"doi":2787},"10.1090\u002FS0002-9947-97-01830-8",{"id":26,"text":2789,"url":26,"identifiers":2790},"Zhou J., Lin C., Hu G.: Spectral radius of Hamiltonian planar graphs and outerplanar graphs. Tsinghua Sci. Technol. 6, 350–354 (2001)",{},{"id":2792,"createTime":2793,"updateTime":2794,"relativeEntities":2795,"slug":2796,"properties":2797,"entityType":814,"verifyStatus":25,"verifyTime":2808,"verifyNote":815,"syncStatus":28,"languages":2809,"translateLanguages":26,"viewCount":36,"primaryUrl":2810,"fullTextUrl":26,"authors":2811,"publicationType":839,"publisherRelationship":2850,"citationCount":534,"citationInfo":2885,"publishDate":2887,"publishYear":2888,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2889,"isForceReanalyzing":877},"1615d9a2-1d6c-4511-9d02-faededff9a72","2024-04-17T15:53:48.989+00:00","2025-01-17T10:43:24.821+00:00",[],"-F-F-Factors-in-Hypergraphs-Via-Absorption",{"mag":2798,"keywords":2800,"openalex":2801,"abstract":2803,"title":2804,"doi":2806},{"VOID":2799},"2171957589",{},{"VOID":2802},"W2171957589",{},{"EN":2805},"$$F$$ F -Factors in Hypergraphs Via Absorption",{"VOID":2807},"10.1007\u002Fs00373-014-1410-8","2025-01-17T10:43:24.820+00:00",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00373-014-1410-8",[2812,2832],{"id":2813,"sortIndex":115,"researcher":26,"roles":2814,"affiliations":2815,"properties":2825},"fad5947b-c4d4-4c0a-9dbe-1e214a36529c",[],[2816],{"id":2817,"sortIndex":36,"affiliation":2818,"properties":26},"1b89cbe4-08de-41e2-b23e-0b8182b7ce1d",{"id":2819,"createTime":2820,"updateTime":2820,"relativeEntities":2821,"slug":26,"properties":2822,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"13f0ff27-12ce-4b73-b99d-364b8e90ab18","2024-01-26T05:31:11.628+00:00",[],{"title":2823},{"VI":2824},"Department of Mathematics and Mathematical Statistics, Umeå University, Umeå, Sweden",{"openalex":2826,"orcid":2828,"title":2830},{"VOID":2827},"A5035765654",{"VOID":2829},"https:\u002F\u002Forcid.org\u002F0000-0002-6344-1642",{"EN":2831},"Klas Markström",{"id":2833,"sortIndex":36,"researcher":26,"roles":2834,"affiliations":2835,"properties":2845},"923b4fc1-45d4-4157-b45a-159c910dd953",[],[2836],{"id":2837,"sortIndex":36,"affiliation":2838,"properties":26},"84f3d963-cbec-416b-a4d8-392085a791e2",{"id":2839,"createTime":2840,"updateTime":2840,"relativeEntities":2841,"slug":26,"properties":2842,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"1535156a-e3d6-4062-b2ba-3d913ed43d00","2023-12-06T15:51:48.330+00:00",[],{"title":2843},{"VI":2844},"School of Mathematics, University of Birmingham, Birmingham, UK",{"openalex":2846,"title":2848},{"VOID":2847},"A5022659483",{"EN":2849},"Allan Lo",{"url":26,"publisher":2851,"properties":2879},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2852,"slug":663,"properties":2853,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2857,"manageAffiliations":2858,"indexDatabases":2859,"url":26,"thumbnailPath":26,"statistic":2874,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":2854,"eissn":2855,"title":2856},{"VOID":666},{"VOID":668},{"EN":670},[],[],[2860,2867],{"id":712,"indexDatabase":2861,"url":725,"indexYears":726,"academicFieldIds":2866,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":2862,"label":2863,"description":2864,"key":722,"publicationTags":2865,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":2868,"url":747,"indexYears":26,"academicFieldIds":2873,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":2869,"label":2870,"description":2871,"key":743,"publicationTags":2872,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":2875,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":2876,"totalCitation":757,"totalCitationByYear":2877,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":2878,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"volume":2880,"pages":2882,"issue":2884},{"VOID":2881},"31",{"VOID":2883},"679-712",{"VOID":1820},{"total":534,"publishYear":26,"statisticByYear":2886},{"2013":115,"2014":59,"2015":135,"2016":356,"2017":158,"2018":59,"2019":158,"2020":158,"2021":135,"2022":158,"2023":50},"2015-05-01",2015,[2890,2894,2898,2902,2905,2908,2912,2916,2920,2923,2927,2930,2934,2937,2940,2944,2947,2951,2955,2959,2963,2967,2971,2975,2979],{"id":26,"text":2891,"url":26,"identifiers":2892},"Alon, N., Spencer, J.H.: The probabilistic method, 2nd edn. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, 2000. With an appendix on the life and work of Paul Erdős",{"doi":2893},"10.1002\u002F0471722154",{"id":26,"text":2895,"url":26,"identifiers":2896},"Corrádi, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hungar. 14, 423–439 (1963)",{"doi":2897},"10.1007\u002FBF01895727",{"id":26,"text":2899,"url":26,"identifiers":2900},"Czygrinow, A., DeBiasio, L., Nagle, B.: Tiling 3-uniform hypergraphs with $$K_4^3-2e.$$ K 4 3 - 2 e . J. Graph Theory 75, 124–136 (2014). Arxiv, preprint arXiv:1108.4140",{"doi":2901},"10.1002\u002Fjgt.21726",{"id":26,"text":2903,"url":26,"identifiers":2904},"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2(3), 69–81 (1952)",{"doi":2192},{"id":26,"text":2906,"url":26,"identifiers":2907},"Duke, R.A., Lefmann, H., Rödl, V.: On uncrowded hypergraphs. In: Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, “Random Graphs ’93” (Poznań, 1993), vol. 6, pp. 209–212 (1995)",{},{"id":26,"text":2909,"url":26,"identifiers":2910},"Erdős, P.: On extremal problems of graphs and generalized graphs. Isr. J. Math. 2, 183–190 (1964)",{"doi":2911},"10.1007\u002FBF02759942",{"id":26,"text":2913,"url":26,"identifiers":2914},"Erdős, P., Simonovits, M.: Supersaturated graphs and hypergraphs. Combinatorica 3(2), 181–192 (1983)",{"doi":2915},"10.1007\u002FBF02579292",{"id":26,"text":2917,"url":26,"identifiers":2918},"Grable, D.A., Phelps, K.T., Rödl, V.: The minimum independence number for designs. Combinatorica 15(2), 175–185 (1995)",{"doi":2919},"10.1007\u002FBF01200754",{"id":26,"text":2921,"url":26,"identifiers":2922},"Hajnal, A., Szemerédi, E.: Proof of a Conjecture of P. Erdős. In: Combinatorial Theory and Its Applications, II (Proc. Colloq., Balatonfüred, 1969), vol. 1970, pp. 601–623. North-Holland, Amsterdam (1969)",{},{"id":26,"text":2924,"url":26,"identifiers":2925},"Hàn, H., Person, Y., Schacht, M.: On perfect matchings in uniform hypergraphs with large minimum vertex degree. SIAM J. Discret. Math. 23(2), 732–748 (2009)",{"doi":2926},"10.1137\u002F080729657",{"id":26,"text":2928,"url":26,"identifiers":2929},"Keevash, P., Mycroft, R.: A geometric theory for hypergraph matching. Mem. Am. Math. Soc. (2011, to appear). arXiv:1108.1757",{},{"id":26,"text":2931,"url":26,"identifiers":2932},"Khan, I.: Perfect matching in 3 uniform hypergraphs with large vertex degree. SIAM J. Discret. Math. 27, 1021–1039 (2013)",{"doi":2933},"10.1137\u002F10080796X",{"id":26,"text":2935,"url":26,"identifiers":2936},"Khan, I.: Perfect matchings in 4-uniform hypergraphs (2011). ArXiv e-prints",{},{"id":26,"text":2938,"url":26,"identifiers":2939},"Kierstead, H., Mubayi, D.: Toward a Hajnal–Szemeredi theorem for hypergraphs (2010). Arxiv, preprint arXiv:1005.4079",{},{"id":26,"text":2941,"url":26,"identifiers":2942},"Kostochka, A., Mubayi, D., Rödl, V., Tetali, P.: On the chromatic number of set systems. Random Struct. Algorithms 19(2), 87–98 (2001)",{"doi":2943},"10.1002\u002Frsa.1020",{"id":26,"text":2945,"url":26,"identifiers":2946},"Kühn, D., Osthus, D.: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory Ser. B 96(6), 767–821 (2006)",{"doi":2506},{"id":26,"text":2948,"url":26,"identifiers":2949},"Kühn, D., Osthus, D.: Matchings in hypergraphs of large minimum degree. J. Graph Theory 51(4), 269–280 (2006)",{"doi":2950},"10.1002\u002Fjgt.20139",{"id":26,"text":2952,"url":26,"identifiers":2953},"Kühn, D., Osthus, D.: Embedding large subgraphs into dense graphs. In: Surveys in Combinatorics 2009. London Mathematical Society Lecture Note Series, vol. 365, pp. 137–167. Cambridge Univ. Press, Cambridge (2009)",{"doi":2954},"10.1017\u002FCBO9781107325975.007",{"id":26,"text":2956,"url":26,"identifiers":2957},"Kühn, D., Osthus, D., Treglown, A.: Matchings in 3-uniform hypergraphs. J. Combin. Theory Ser. B 103(2), 291–305 (2013)",{"doi":2958},"10.1016\u002Fj.jctb.2012.11.005",{"id":26,"text":2960,"url":26,"identifiers":2961},"Lo, A., Markström, K.: A multipartite version of the Hajnal–Szemerédi theorem for graphs and hypergraphs. Combin. Probab. Comput. 22(1), 97–111 (2012)",{"doi":2962},"10.1017\u002FS096354831200048X",{"id":26,"text":2964,"url":26,"identifiers":2965},"Lo, A., Markström, K.: Minimum codegree threshold for $$(K_4^3-e)$$ ( K 4 3 - e ) -factors. J. Combin. Theory Ser. A 120(3), 708–721 (2013)",{"doi":2966},"10.1016\u002Fj.jcta.2012.12.005",{"id":26,"text":2968,"url":26,"identifiers":2969},"Pikhurko, O.: Perfect matchings and $$K^{3}_{4}$$ K 4 3 -tilings in hypergraphs of large codegree. Graphs Combin. 24(4), 391–404 (2008)",{"doi":2970},"10.1007\u002Fs00373-008-0787-7",{"id":26,"text":2972,"url":26,"identifiers":2973},"Rödl, V., Ruciński, A.: Dirac-type questions for hypergraphs—a survey (or more problems for Endre to solve). In: An Irregular Mind (Szemerédi is 70), vol. 21. Bolyai Soc. Math. Studies (2010)",{"doi":2974},"10.1007\u002F978-3-642-14444-8_16",{"id":26,"text":2976,"url":26,"identifiers":2977},"Rödl, V., Ruciński, A., Szemerédi, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory Ser. A 116(3), 613–636 (2009)",{"doi":2978},"10.1016\u002Fj.jcta.2008.10.002",{"id":26,"text":2980,"url":26,"identifiers":2981},"Yuster, R.: Combinatorial and computational aspects of graph packing and graph decomposition. Comput. Sci. Rev. 1(1), 12–26 (2007)",{"doi":2982},"10.1016\u002Fj.cosrev.2007.07.002",{"id":2984,"createTime":2985,"updateTime":2985,"relativeEntities":2986,"slug":2987,"properties":2988,"entityType":814,"verifyStatus":25,"verifyTime":2999,"verifyNote":815,"syncStatus":28,"languages":3000,"translateLanguages":26,"viewCount":36,"primaryUrl":3001,"fullTextUrl":26,"authors":3002,"publicationType":839,"publisherRelationship":3023,"citationCount":3058,"citationInfo":3059,"publishDate":1260,"publishYear":1261,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":3061,"isForceReanalyzing":877},"a06bc0ec-9aeb-4c0c-b955-c70e031f80ee","2024-10-03T00:07:56.127+00:00",[],"Linking-n-2-dimensional-panels-inn-space-II-n-2-2-frameworks-and-body-and-hinge-structures",{"mag":2989,"keywords":2991,"openalex":2992,"abstract":2994,"title":2995,"doi":2997},{"VOID":2990},"2009251274",{},{"VOID":2993},"W2009251274",{},{"EN":2996},"Linking (n − 2)-dimensional panels inn-space II: (n − 2, 2)-frameworks and body and hinge structures",{"VOID":2998},"10.1007\u002Fbf01788678","2024-10-03T00:07:56.126+00:00",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01788678",[3003],{"id":3004,"sortIndex":36,"researcher":26,"roles":3005,"affiliations":3006,"properties":3018},"e56e4efe-3a02-48b9-85af-59580a69060d",[],[3007],{"id":3008,"sortIndex":36,"affiliation":3009,"properties":26},"8f8248e3-39ac-4ffb-ad25-90340ddc345b",{"id":3010,"createTime":3011,"updateTime":3012,"relativeEntities":3013,"slug":3014,"properties":3015,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"12379e2c-245d-46c1-8215-35617ee32a8c","2023-12-01T04:52:03.279+00:00","2024-10-06T16:48:10.849+00:00",[],"Department-of-Mathematics-National-University-of-Singapore-Singapore",{"title":3016},{"VI":3017},"Department of Mathematics, National University of Singapore, Singapore",{"openalex":3019,"title":3021},{"VOID":3020},"A5035225056",{"EN":3022},"Tiong-Seng Tay",{"url":26,"publisher":3024,"properties":3052},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":3025,"slug":663,"properties":3026,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":3030,"manageAffiliations":3031,"indexDatabases":3032,"url":26,"thumbnailPath":26,"statistic":3047,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":3027,"eissn":3028,"title":3029},{"VOID":666},{"VOID":668},{"EN":670},[],[],[3033,3040],{"id":712,"indexDatabase":3034,"url":725,"indexYears":726,"academicFieldIds":3039,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":3035,"label":3036,"description":3037,"key":722,"publicationTags":3038,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":3041,"url":747,"indexYears":26,"academicFieldIds":3046,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":3042,"label":3043,"description":3044,"key":743,"publicationTags":3045,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":3048,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":3049,"totalCitation":757,"totalCitationByYear":3050,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":3051,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"volume":3053,"pages":3055,"issue":3057},{"VOID":3054},"5",{"VOID":3056},"245-273",{"VOID":1979},55,{"total":3058,"publishYear":26,"statisticByYear":3060},{"2012":162,"2013":111,"2014":162,"2015":162,"2016":59,"2018":115,"2020":115,"2021":59,"2022":114,"2023":59},[3062,3065,3068,3072,3075,3079,3082,3085,3089,3092,3096],{"id":26,"text":3063,"url":26,"identifiers":3064},"Baracs, J.: Rigidity of Articulated Panel Structures. Bulletin of International Association for Shell and spatial Structures 59,XVI-3 (1975)",{},{"id":26,"text":3066,"url":26,"identifiers":3067},"Crapo, H., Whiteley, W.: Statics of Frameworks and Motions of Panel Structures: A Projective Geometric Introduction. Structural Topology6, 43–82 (1982)",{},{"id":26,"text":3069,"url":26,"identifiers":3070},"Doubilet, P., Rota, G. C., Stein, J.: On the Foundations of Combinatorial Theory IX: Combinatorial Methods in Invariant Theory. Stud. Appl. Math.LIII, 185–216 (1974)",{"doi":3071},"10.1002\u002Fsapm1974533185",{"id":26,"text":3073,"url":26,"identifiers":3074},"Hodge, W. V. D., Pedoe, D.: Methods of Algebraic Geometry, Vol. I. Cambridge: Cambridge Univ. Press 1953",{},{"id":26,"text":3076,"url":26,"identifiers":3077},"Nash-Williams, C. St. J.: Edge Disjoint Spanning Trees of Finite Graphs. J. London Math. Soc.36, 445–450 (1961)",{"doi":3078},"10.1112\u002Fjlms\u002Fs1-36.1.445",{"id":26,"text":3080,"url":26,"identifiers":3081},"Tay, T. S.: Linking (n − 2)-Dimensional Panels inn-Space I: (k − 1, k)-Graphs and (k − 1, k)-Frames. In: Research Report 264. Singapore: Mathematical Department, National University of Singapore 1986",{},{"id":26,"text":3083,"url":26,"identifiers":3084},"Tay, T. S., Whiteley, W.: Recent Advances in the Generic Rigidity of Structures. Structural Topology9, 31–38 (1984)",{},{"id":26,"text":3086,"url":26,"identifiers":3087},"Tutte, W. T.: On the Problem of Decomposing a Graph inton Connected Factors. J. London Math. Soc.36, 221–230 (1961)",{"doi":3088},"10.1112\u002Fjlms\u002Fs1-36.1.221",{"id":26,"text":3090,"url":26,"identifiers":3091},"White, N., Whiteley, W.: A Class of Matroids Defined on Graphs and Hypergraphs by Counting Properties. Gainsville: University of Florida (Preprint)",{},{"id":26,"text":3093,"url":26,"identifiers":3094},"Whiteley, W.: Infinitesimally Rigid Polyhedra I: Statics of Frameworks. Trans. Amer. Math. Soc.285, 431–465 (1984)",{"doi":3095},"10.1090\u002FS0002-9947-1984-0752486-6",{"id":26,"text":3097,"url":26,"identifiers":3098},"Whiteley, W.: Introduction to Structural Geometry 1: Infinitesimal Motions and Infinitesimal Rigidity. Champlain Regional College Quebec: (Preprint)",{},{"id":3100,"createTime":3101,"updateTime":3102,"relativeEntities":3103,"slug":3104,"properties":3105,"entityType":814,"verifyStatus":25,"verifyTime":3102,"verifyNote":815,"syncStatus":28,"languages":3116,"translateLanguages":26,"viewCount":36,"primaryUrl":3117,"fullTextUrl":26,"authors":3118,"publicationType":839,"publisherRelationship":3155,"citationCount":281,"citationInfo":3184,"publishDate":3186,"publishYear":3187,"citationAnalyzeStatus":874,"lastCitationAnalyze":3188,"indexDatabases":26,"openAccess":26,"references":3189,"isForceReanalyzing":877},"84a494f7-f00c-41b4-82d8-ea81e7e852cc","2024-04-13T20:51:55.038+00:00","2024-10-27T08:31:53.809+00:00",[],"The-Zero-divisor-Graphs-of-Posets-and-an-Application-to-Semigroups",{"mag":3106,"keywords":3108,"openalex":3109,"abstract":3111,"title":3112,"doi":3114},{"VOID":3107},"2018151609",{},{"VOID":3110},"W2018151609",{},{"EN":3113},"The Zero-divisor Graphs of Posets and an Application to Semigroups",{"VOID":3115},"10.1007\u002Fs00373-010-0955-4",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs00373-010-0955-4",[3119,3138],{"id":3120,"sortIndex":115,"researcher":26,"roles":3121,"affiliations":3122,"properties":3131},"f6c1db59-df7a-4f3d-be78-37054df1103c",[],[3123],{"id":26,"sortIndex":36,"affiliation":3124,"properties":26},{"id":3125,"createTime":3126,"updateTime":3126,"relativeEntities":3127,"slug":26,"properties":3128,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"52c25382-9dda-454a-990f-e07b3d066c34","2024-02-11T23:58:13.718+00:00",[],{"title":3129},{"VI":3130},"Department of Mathematics, Shanghai Jiaotong University, Shanghai, People’s Republic of China",{"openalex":3132,"orcid":3134,"title":3136},{"VOID":3133},"A5034560014",{"VOID":3135},"https:\u002F\u002Forcid.org\u002F0000-0003-2488-9775",{"EN":3137},"Tingzeng Wu",{"id":3139,"sortIndex":36,"researcher":26,"roles":3140,"affiliations":3141,"properties":3150},"3aa4415b-4f77-4759-ae41-87e1e537c85d",[],[3142],{"id":26,"sortIndex":36,"affiliation":3143,"properties":26},{"id":3144,"createTime":3145,"updateTime":3145,"relativeEntities":3146,"slug":26,"properties":3147,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"38e02dc7-1b6c-485f-8d0b-a6274be5d5e9","2024-01-01T06:08:48.939+00:00",[],{"title":3148},{"VI":3149},"Department of Mathematics, Soochow University, Suzhou,  People’s Republic of China",{"openalex":3151,"title":3153},{"VOID":3152},"A5020540331",{"EN":3154},"Dancheng Lu",{"url":26,"publisher":3156,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":3157,"slug":663,"properties":3158,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":3162,"manageAffiliations":3163,"indexDatabases":3164,"url":26,"thumbnailPath":26,"statistic":3179,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":3159,"eissn":3160,"title":3161},{"VOID":666},{"VOID":668},{"EN":670},[],[],[3165,3172],{"id":712,"indexDatabase":3166,"url":725,"indexYears":726,"academicFieldIds":3171,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":3167,"label":3168,"description":3169,"key":722,"publicationTags":3170,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":3173,"url":747,"indexYears":26,"academicFieldIds":3178,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":3174,"label":3175,"description":3176,"key":743,"publicationTags":3177,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":3180,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":3181,"totalCitation":757,"totalCitationByYear":3182,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":3183,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"total":281,"publishYear":26,"statisticByYear":3185},{"2012":111,"2013":162,"2014":162,"2015":59,"2016":162,"2017":50,"2018":59,"2019":114,"2020":115,"2021":59,"2022":162,"2023":111,"2024":59},"2010-11-01",2010,"2024-04-14T07:17:16.073+00:00",[3190,3194,3198,3202,3206,3209,3213,3217,3221,3225,3229,3233,3236,3240],{"id":26,"text":3191,"url":26,"identifiers":3192},"Anderson D.F., Levy J., Shapiro R.: Zero-divisor graphs, von Neumann regular rings, and Boolean algebras. J. Pure Appl. Algebra 180, 221–241 (2003)",{"doi":3193},"10.1016\u002FS0022-4049(02)00250-5",{"id":26,"text":3195,"url":26,"identifiers":3196},"Anderson D.D., Naseer M.: Beck’s coloring of a commutative ring. J. Algebra 159, 500–514 (1993)",{"doi":3197},"10.1006\u002Fjabr.1993.1171",{"id":26,"text":3199,"url":26,"identifiers":3200},"Beck I.: Coloring of commutative rings. J. Algebra 116, 208–226 (1988)",{"doi":3201},"10.1016\u002F0021-8693(88)90202-5",{"id":26,"text":3203,"url":26,"identifiers":3204},"DeMeyer F.R., DeMeyer L.: Zero-divisor graphs of semigroups. J. Algebra 283, 190–198 (2005)",{"doi":3205},"10.1016\u002Fj.jalgebra.2004.08.028",{"id":26,"text":3207,"url":26,"identifiers":3208},"Nimbhorkar S.K., Wasadikhar M.P., Demeyer L.: Coloring of meet-semilattices. ARS Comb. 84, 97–104 (2007)",{},{"id":26,"text":3210,"url":26,"identifiers":3211},"Dilworth R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161–166 (1950)",{"doi":3212},"10.2307\u002F1969503",{"id":26,"text":3214,"url":26,"identifiers":3215},"DeMeyer F.R., McKenzie T., Schneider K.: The zero-divisor graph of a commutative semigroup. Semigroup Forum 65, 206–214 (2002)",{"doi":3216},"10.1007\u002Fs002330010128",{"id":26,"text":3218,"url":26,"identifiers":3219},"Halaš R.: On extensions of ideals in posets. Discrete Math. 308, 4972–4977 (2008)",{"doi":3220},"10.1016\u002Fj.disc.2007.09.022",{"id":26,"text":3222,"url":26,"identifiers":3223},"Halaš R.: Ideals and annihilators in ordered sets. Czech. Math. J. 45, 127–134 (1995)",{"doi":3224},"10.21136\u002FCMJ.1995.128502",{"id":26,"text":3226,"url":26,"identifiers":3227},"Halaš R., Lihová J.: On weakly-cut stable maps. Inf. Sci. 180, 971–983 (2010)",{"doi":3228},"10.1016\u002Fj.ins.2009.11.025",{"id":26,"text":3230,"url":26,"identifiers":3231},"Halaš R., Jukl M.: On Beck’s coloring of posets. Discrete Math. 309, 4584–4589 (2009)",{"doi":3232},"10.1016\u002Fj.disc.2009.02.024",{"id":26,"text":3234,"url":26,"identifiers":3235},"Halaš, R., Länger, H.: The zero-divisor graph of a qoset. Order (2009). doi: 10.1007\u002Fs11083009-9120-1",{},{"id":26,"text":3237,"url":26,"identifiers":3238},"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (2001)",{"doi":3239},"10.1017\u002FCBO9780511987045",{"id":26,"text":3241,"url":26,"identifiers":3242},"Wu T.S., Lu D.C.: Sub-semigroups of determined by the zero-divisor graph. Discrete Math. 308, 5122–5135 (2008)",{"doi":3243},"10.1016\u002Fj.disc.2007.09.032",{"id":3245,"createTime":3246,"updateTime":3247,"relativeEntities":3248,"slug":3249,"properties":3250,"entityType":814,"verifyStatus":25,"verifyTime":3247,"verifyNote":815,"syncStatus":28,"languages":3261,"translateLanguages":26,"viewCount":36,"primaryUrl":3262,"fullTextUrl":26,"authors":3263,"publicationType":839,"publisherRelationship":3334,"citationCount":259,"citationInfo":3368,"publishDate":3370,"publishYear":3371,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":3372,"isForceReanalyzing":877},"f22009b9-283c-46ed-92aa-53ec8ba58585","2024-04-19T23:17:33.455+00:00","2024-12-31T01:27:35.985+00:00",[],"Ramsey-numbers-for-local-colorings",{"mag":3251,"keywords":3253,"openalex":3254,"abstract":3256,"title":3257,"doi":3259},{"VOID":3252},"1999618770",{},{"VOID":3255},"W1999618770",{},{"EN":3258},"Ramsey numbers for local colorings",{"VOID":3260},"10.1007\u002Fbf01788549",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF01788549",[3264,3284,3299,3319],{"id":3265,"sortIndex":59,"researcher":26,"roles":3266,"affiliations":3267,"properties":3279},"027bb216-e043-44b6-ad79-f8f4ddc8ec76",[],[3268],{"id":3269,"sortIndex":36,"affiliation":3270,"properties":26},"2c43e022-4821-4f73-b111-e803553bfde5",{"id":3271,"createTime":3272,"updateTime":3273,"relativeEntities":3274,"slug":3275,"properties":3276,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"3365510a-59db-4256-ae4b-4b12bb90f5f4","2024-04-19T23:17:33.503+00:00","2024-09-24T18:32:44.949+00:00",[],"Computer-and-Automation-Institute-Hungarian-Academy-of-Sciences-Kende-u-13-17-1111-Budapest-Hungary",{"title":3277},{"EN":3278},"Computer and Automation Institute, Hungarian Academy of Sciences, Kende u. 13-17, 1111, Budapest, Hungary",{"openalex":3280,"title":3282},{"VOID":3281},"A5058903630",{"EN":3283},"Zs. Tuza",{"id":3285,"sortIndex":36,"researcher":26,"roles":3286,"affiliations":3287,"properties":3294},"8cd88761-fd48-4a13-87bd-2db090ac491a",[],[3288],{"id":3289,"sortIndex":36,"affiliation":3290,"properties":26},"654bd410-c324-4fa1-b62c-4fcddf359083",{"id":3271,"createTime":3272,"updateTime":3273,"relativeEntities":3291,"slug":3275,"properties":3292,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":3293},{"EN":3278},{"openalex":3295,"title":3297},{"VOID":3296},"A5020847160",{"EN":3298},"András Gyárfás",{"id":3300,"sortIndex":114,"researcher":26,"roles":3301,"affiliations":3302,"properties":3314},"e0dcff70-cf35-49b3-abd2-d29f74dda7d4",[],[3303],{"id":3304,"sortIndex":36,"affiliation":3305,"properties":26},"c2bcb3b2-d6fe-4ef4-81cd-77945931fa7c",{"id":3306,"createTime":3307,"updateTime":3308,"relativeEntities":3309,"slug":3310,"properties":3311,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"3cafc7cc-9abe-4bc4-8755-83daf8fc318f","2024-04-19T23:17:33.493+00:00","2024-09-24T07:10:32.020+00:00",[],"Memphis-State-University-38152-Memphis-TN-USA",{"title":3312},{"EN":3313},"Memphis State University, 38152, Memphis, TN, USA",{"openalex":3315,"title":3317},{"VOID":3316},"A5057185425",{"EN":3318},"R. H. Schelp",{"id":3320,"sortIndex":115,"researcher":26,"roles":3321,"affiliations":3322,"properties":3329},"230699b6-b7c0-4ebf-816e-21fe4383a240",[],[3323],{"id":3324,"sortIndex":36,"affiliation":3325,"properties":26},"65eab2dd-a8b2-4c23-a724-607638c09a48",{"id":3271,"createTime":3272,"updateTime":3273,"relativeEntities":3326,"slug":3275,"properties":3327,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":3328},{"EN":3278},{"openalex":3330,"title":3332},{"VOID":3331},"A5089439989",{"EN":3333},"Jenő Lehel",{"url":26,"publisher":3335,"properties":3363},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":3336,"slug":663,"properties":3337,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":3341,"manageAffiliations":3342,"indexDatabases":3343,"url":26,"thumbnailPath":26,"statistic":3358,"gsStatistic":26,"type":26,"analyzePriority":26},[],{"issn":3338,"eissn":3339,"title":3340},{"VOID":666},{"VOID":668},{"EN":670},[],[],[3344,3351],{"id":712,"indexDatabase":3345,"url":725,"indexYears":726,"academicFieldIds":3350,"indexDatabaseRanking":730},{"id":714,"createTime":715,"updateTime":716,"relativeEntities":3346,"label":3347,"description":3348,"key":722,"publicationTags":3349,"standard":26},[],{"EN":719,"VI":719},{"EN":719,"VI":721},[724],[728,729],{"id":732,"indexDatabase":3352,"url":747,"indexYears":26,"academicFieldIds":3357,"indexDatabaseRanking":26},{"id":734,"createTime":735,"updateTime":736,"relativeEntities":3353,"label":3354,"description":3355,"key":743,"publicationTags":3356,"standard":26},[],{"EN":739,"VI":739},{"VI":741,"EN":742},[745,746],[749],{"impactFactor":36,"impactFactorByYear":3359,"i10Index":536,"i10IndexLast5Year":111,"totalPublication":752,"totalPublicationByYear":3360,"totalCitation":757,"totalCitationByYear":3361,"totalCitationPerPublication":767,"totalCitationPerPublicationByYear":3362,"hindexLast5Year":241,"hindex":241},{"2012":404,"2013":54,"2014":341,"2015":128,"2016":153,"2017":54,"2018":108,"2019":108,"2020":206,"2021":342,"2022":108,"2023":404},{"1985":287,"1986":239,"1987":241,"1988":124,"1989":252,"1990":240,"1991":238,"1992":396,"1993":260,"1994":79,"1995":238,"1996":53,"1997":52,"1998":238,"1999":255,"2000":241,"2001":286,"2002":539,"2003":397,"2004":79,"2005":517,"2006":255,"2007":259,"2008":159,"2009":608,"2010":568,"2011":357,"2012":754,"2013":165,"2014":755,"2015":361,"2016":359,"2017":46,"2018":652,"2019":253,"2020":117,"2021":258,"2022":366,"2023":756,"2024":79},{"1985":755,"1986":173,"1987":166,"1988":282,"1989":759,"1990":569,"1991":248,"1992":284,"1993":111,"1994":204,"1995":760,"1996":242,"1997":260,"1998":48,"1999":239,"2000":652,"2001":397,"2002":366,"2003":761,"2004":762,"2005":652,"2006":763,"2007":250,"2008":255,"2009":251,"2010":764,"2011":253,"2012":349,"2013":765,"2014":766,"2015":615,"2016":357,"2017":259,"2018":222,"2019":569,"2020":240,"2021":287,"2022":159,"2023":111},{"1985":769,"1986":770,"1987":771,"1988":772,"1989":773,"1990":114,"1991":774,"1992":775,"1993":513,"1994":776,"1995":777,"1996":778,"1997":779,"1998":780,"1999":154,"2000":781,"2001":782,"2002":783,"2003":784,"2004":785,"2005":786,"2006":781,"2007":787,"2008":788,"2009":789,"2010":790,"2011":406,"2012":293,"2013":791,"2014":376,"2015":407,"2016":381,"2017":770,"2018":792,"2019":293,"2020":476,"2021":792,"2022":232,"2023":109},{"volume":3364,"pages":3365,"issue":3367},{"VOID":1820},{"VOID":3366},"267-277",{"VOID":1979},{"total":259,"publishYear":26,"statisticByYear":3369},{"2012":115,"2013":115,"2014":114,"2015":114,"2017":114,"2019":59,"2020":114,"2023":114,"2024":115},"1987-12-01",1987,[3373,3376,3380,3383,3387,3391,3394,3397,3401,3404,3408,3412,3416],{"id":26,"text":3374,"url":26,"identifiers":3375},"Burr, S.A., Erdös, P.: Extremal Ramsey theory for graphs. Utilitas math.9, 247–258 (1976)",{},{"id":26,"text":3377,"url":26,"identifiers":3378},"Burr, S.A., Erdös, P., Spencer, J.H.: Ramsey theorems for multiple copies of graphs. Trans. Amer. Math. Soc.209, 87–99 (1975)",{"doi":3379},"10.1090\u002FS0002-9947-1975-0409255-0",{"id":26,"text":3381,"url":26,"identifiers":3382},"Burr, S.A., Roberts, J.A.: On Ramsey numbers for stars. Utilitas Math.4, 217–220 (1973)",{},{"id":26,"text":3384,"url":26,"identifiers":3385},"Chung, F.R.K.: On a Ramsey-type problem. J. Graph Theory.7, 79–83 (1983)",{"doi":3386},"10.1002\u002Fjgt.3190070110",{"id":26,"text":3388,"url":26,"identifiers":3389},"Cockayne, E.J., Lorimer, P.J.: The Ramsey graph numbers for stripes. J. Aust. Math. Soc.19, 252–256 (1975)",{"doi":3390},"10.1017\u002FS1446788700029554",{"id":26,"text":3392,"url":26,"identifiers":3393},"Erdös, P. Faudree, R.J., Rousseau, C.C., Schelp, R.H.: Ramsey numbers for brooms, Utilitas Math.35, 283–293 (1982)",{},{"id":26,"text":3395,"url":26,"identifiers":3396},"Erdös, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Colloq. Math. Soc. Janos. Bolyai10, 609–627 (1974)",{},{"id":26,"text":3398,"url":26,"identifiers":3399},"Faudree, R.J., Schelp, R.H.: All Ramsey numbers for cycles in graphs. Discrete Math.8, 313–329 (1974)",{"doi":3400},"10.1016\u002F0012-365X(74)90151-4",{"id":26,"text":3402,"url":26,"identifiers":3403},"Gerencsér, L., Gyárfás, A.: On Ramsey type problems. Ann. Univ. Sci. Budap. Eötvös Eötvos Sect. Math.10, 167–170 (1967)",{},{"id":26,"text":3405,"url":26,"identifiers":3406},"Greenwoood, R.E., Gleason, A.M.: Combinatorial relations and chromatic graphs. Can. J. Math.9, 1–7 (1955)",{"doi":3407},"10.4153\u002FCJM-1955-001-4",{"id":26,"text":3409,"url":26,"identifiers":3410},"Irving, R.W.: Generalized Ramsey numbers for small graphs. Discrete Math.9, 251–264 (1974)",{"doi":3411},"10.1016\u002F0012-365X(74)90008-9",{"id":26,"text":3413,"url":26,"identifiers":3414},"Ray-Chaudhuri, D.K. Wilson, R.M.: Solution of Kirkman's school girl problem. Proc. Symp. Pure Math.19, 187–204 (1972)",{"doi":3415},"10.1090\u002Fpspum\u002F019\u002F9959",{"id":26,"text":3417,"url":26,"identifiers":3418},"Rosta, V.: On a Ramsey type problem of J.A. Bondy and P. Erdös I, II. J. Comb. Theory (B)15, 94–120 (1973)",{"doi":3419},"10.1016\u002F0095-8956(73)90035-X"]