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.
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
Bipartite Graphs With Minimum Degree at Least 15 Are Antimagic
AuthorsKecai Deng
Affiliations1. School of Mathematical Sciences Huaqiao University Quanzhou Fujian PR China
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
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
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
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
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
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
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
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
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.
