CrushSCI.com
Journal Selection & Manuscript Polishing Services
JOURNAL OF GRAPH THEORY journal cover Mathematics
Back to journal directory

Review Cycle Records

JOURNAL OF GRAPH THEORY

Wiley SCIE Non-OA
2026 Emerging Zone 32025 CAS Zone 22025 JCR Q2
697.2Average days
568.5Median days
247Fastest days
1,892Longest days
922025 publications

Paper Review Records

All Paper Review Records

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

661 days

Hitting Times in the Binomial Random Graph

AuthorsBertille Granet; Felix Joos; Jonathan Schrodt

Affiliations1. Warwick Mathematics Institute University of Warwick Coventry UK; 2. Institut für Informatik Universität Heidelberg Germany

Source PDF DOI Publisher page
564 days

Bipartite Graphs With Minimum Degree at Least 15 Are Antimagic

AuthorsKecai Deng

Affiliations1. School of Mathematical Sciences Huaqiao University Quanzhou Fujian PR China

Source PDF DOI Publisher page
573 days

Normal Approximation for Subgraph Count in Random Hypergraphs

AuthorsMikołaj Nieradko; Wojciech Michalczuk; Grzegorz Serafin

Affiliations1. Faculty of Pure and Applied Mathematics Wrocław University of Science and Technology Wrocław Poland

Source PDF DOI Publisher page
661 days

The k‐Radius of 2‐Connected Graphs

AuthorsPeter Dankelmann; Paul Horn

Affiliations1. Department of Mathematics and Applied Mathematics University of Johannesburg Johannesburg South Africa; 2. Department of Mathematics University of Denver Denver Colorado USA

Source PDF DOI Publisher page
510 days

B‐Coloring of Planar Graphs

AuthorsJiangxu Kong; Yiqiao Wang; Mengmeng Zheng

Affiliations1. School of Mathematics Hangzhou Normal University Hangzhou China; 2. Department of Mathematics Beijing University of Technology Beijing China; 3. School of Mathematical Sciences Zhejiang Normal University Jinhua China

Source PDF DOI Publisher page
502 days

Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs

AuthorsStefanie Gerke; Gregory Gutin; Anders Yeo; Yacong Zhou

Affiliations1. Department of Mathematics Royal Holloway University of London Egham UK; 2. Department of Computer Science Royal Holloway University of London Egham UK; 3. Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark; 4. Department of Mathematics University of Johannesburg Auckland Park Johannesburg South Africa; 5. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China

Source PDF DOI Publisher page
524 days

Realizing Degree Sequences With S3‐Connected Graphs

AuthorsRui Guan; Chenglin Jiang; Hong‐Jian Lai; Jiaao Li; Xinyuan Li

Affiliations1. School of Mathematical Sciences and LPMC Nankai University Tianjin China; 2. School of Mathematics and Systems Science Guangdong Polytechnic Normal University Guangzhou China; 3. Department of Mathematics West Virginia University Morgantown West Virginia USA

Source PDF DOI Publisher page
544 days

On a Clique‐Building Game of Erdős

AuthorsAlexandru Malekshahian; Sam Spiro

Affiliations1. Department of Mathematics King's College London London England; 2. Mathematical Institute University of Oxford Oxford England; 3. Department of of Mathematics Georgia State University Atlanta Georgia USA

Source PDF DOI Publisher page
645 days

On the Hardness of Switching to a Small Number of Edges

AuthorsVít Jelínek; Eva Jelínková; Jan Kratochvíl

Affiliations1. Computer Science Institute Faculty of Mathematics and Physics, Charles University Prague Czech Republic; 2. Department of Mathematics University of Chemistry and Technology Prague Czech Republic; 3. Department of Applied Mathematics Faculty of Mathematics and Physics, Charles University Prague Czech Republic

Source PDF DOI Publisher page
826 days

On Deep‐Commuting Graph of Groups

AuthorsBahram Arvin; Behrouz Edalatzadeh; Ali Reza Salemkar

Affiliations1. Department of Mathematics Faculty of Science Razi University Kermanshah Iran; 2. Faculty of Mathematical Sciences Shahid Beheshti University Tehran Iran

Source PDF DOI Publisher page

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.

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 review96.4 days

Median77 days

Contact CrushSCI

Contact CrushSCI

Leave your contact details so we can discuss your manuscript, editing needs, and submission plan.

Selected service: Paper Editing Service

Or leave your contact details

WhatsApp, Telegram, WeChat, and email are all optional, but at least one is required. Once received, we will contact you as soon as possible.