Paper Review Records
全部论文审稿周期
30 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
184
天
A Characterization of P6‐Free Irredundance Perfect Graphs
作者
Vadim Zverovich; Pavel Skums; Lutz Volkmann展开收起
作者单位
1. Mathematics and Statistics Research Group University of the West of England Bristol UK; 2. School of Computing University of Connecticut Storrs Connecticut USA; 3. Institute for Geometry and Practical Mathematics RWTH Aachen University Aachen Germany展开收起
1,098
天
859
天
984
天
Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
作者
Patrick Bennett; Emily Heath; Shira Zerbib展开收起
作者单位
1. Department of Mathematics Western Michigan University Kalamazoo Michigan USA; 2. Department of Mathematics and Statistics California State Polytechnic University Pomona California USA; 3. Department of Mathematics Iowa State University Ames Iowa USA展开收起
409
天
A Generalization of an Ear Decomposition and k‐Trees in Highly Connected Star‐Free Graphs
作者
Shun‐ichi Maezawa; Kenta Ozeki; Masaki Yamamoto; Takamasa Yashima展开收起
作者单位
1. Department of Information Science Nihon University, Setagaya-ku Tokyo Japan; 2. Faculty of Environment and Information Sciences Yokohama National University, Yokohama Kanagawa Japan; 3. Department of Computer and Information Science Seikei University, Musashino Tokyo Japan; 4. Kanazawa Institute of Technology, Nonoichi Ishikawa Japan展开收起
199
天
The Turán Number of Berge Paths
作者
Xin Cheng; Dániel Gerbner; Hilal Hama Karim; Shujing Miao; Junpeng Zhou展开收起
作者单位
1. School of Mathematics and Statistics Northwestern Polytechnical University and Xi'an‐Budapest Joint Research Center for Combinatorics Xi'an Shaanxi China; 2. Alfréd Rényi Institute of Mathematics, HUN‐REN Budapest Hungary; 3. Department of Computer Science and Information Theory Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics Budapest Hungary; 4. School of Mathematics and Statistics Hunan First Normal University Changsha China; 5. Department of Mathematics Shanghai University Shanghai China; 6. Newtouch Center for Mathematics Shanghai University Shanghai China展开收起
FAQ
JOURNAL OF GRAPH THEORY审稿要多久?
截至2026-11-17,CrushSCI 收录了 JOURNAL OF GRAPH THEORY 的 30 篇完整审稿记录。最快一篇从收稿到录用用了 184 天(A Characterization of P6‐Free Irredundance Perfect Graphs,2026-04-06 收稿,2026-10-07 录用),最慢一篇用了 1892 天;平均 654.0 天,中位数 554 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
