CrushSCI.com
654.0Average days
554Median days
184Fastest days
1,892Longest days
922025 publications

Paper Review Records

All Paper Review Records

30 valid samples · Newest publication first
Review days = acceptance date − received date. PDF, DOI, and publisher-page sources are retained.

184 days

A Characterization of P6‐Free Irredundance Perfect Graphs

Authors
Vadim Zverovich; Pavel Skums; Lutz VolkmannShow moreShow less
Affiliations
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 GermanyShow moreShow less
Source PDF DOI Publisher page
1,098 days

Covering Multigraphs With Bipartite Graphs

Authors
Jaehoon Kim; Hyunwoo LeeShow moreShow less
Affiliations
1. Department of Mathematical Sciences KAIST Daejeon South KoreaShow moreShow less
Source PDF DOI Publisher page
859 days

Toward Pancyclicity in 4‐Connected Planar Graphs

Authors
Bojan Mohar; Abhinav ShantanamShow moreShow less
Affiliations
1. Department of Mathematics Simon Fraser University Burnaby British Columbia Canada; 2. Department of Mathematics Université Libre de Bruxelles Brussels BelgiumShow moreShow less
Source PDF DOI Publisher page
984 days

Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class

Authors
Patrick Bennett; Emily Heath; Shira ZerbibShow moreShow less
Affiliations
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 USAShow moreShow less
Source PDF DOI Publisher page
409 days

A Generalization of an Ear Decomposition and k‐Trees in Highly Connected Star‐Free Graphs

Authors
Shun‐ichi Maezawa; Kenta Ozeki; Masaki Yamamoto; Takamasa YashimaShow moreShow less
Affiliations
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 JapanShow moreShow less
Source PDF DOI Publisher page
199 days

The Turán Number of Berge Paths

Authors
Xin Cheng; Dániel Gerbner; Hilal Hama Karim; Shujing Miao; Junpeng ZhouShow moreShow less
Affiliations
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 ChinaShow moreShow less
Source PDF DOI Publisher page

FAQ

How long does JOURNAL OF GRAPH THEORY take to review a manuscript?

As of 2026-11-17, CrushSCI has 30 complete review records for JOURNAL OF GRAPH THEORY. The fastest paper went from submission to acceptance in 184 days (A Characterization of P6‐Free Irredundance Perfect Graphs, received 2026-04-06, accepted 2026-10-07); the slowest took 1892 days. The average is 654.0 days and the median is 554 days.

Expert Matching · Case Demo

Turn Your Submission Goalsinto a Verifiable Journal Plan

Share your field, deadline, and author profile. CrushSCI uses real review records to suggest a title direction, shortlist journals, and estimate timelines.

We will reply within 30 minutes.

CrushSCI online

Client

I work in environmental engineering and need an SCI paper published within three months. I have no grant funding or prominent co-author. Which journals could I target?

CrushSCI

Yes. We will first screen for feasibility against the 90-day deadline, then identify comparable papers without grant support or prominent co-authors. The final shortlist will prioritize research quality and journal scope.

Suggested title
Machine Learning and Life-Cycle Assessment for Predicting and Optimizing Carbon Emissions in Urban Wastewater Treatment

SampleLatest 5 valid paper samples from 2026

Average review59.6 days

Median65 days

Contact CrushSCI

Contact CrushSCI

Leave your email address to discuss academic polishing, structural refinement, or one-to-one guidance.

We will reply within 30 minutes.

Selected service: Academic Consulting Service

Leave your email address

Or email us directly at leader@crushsci.com

Enter your email address so we can reply. Your details will remain private.