Promote Sponsor
verified SJR 2,312 · Q1 • database Scopus / SJR & Web of Science indexed
Journal of Combinatorial Theory. Series B
United States · Academic Press Inc.
workspace_premium Q1 — Computational Theory and Mathematics lock Subscription Unclaimed

Journal of Combinatorial Theory. Series B

Journal of Combinatorial Theory. Series B is a journal indexed in SJR in Computational Theory and Mathematics and Discrete Mathematics and Combinatorics with an H index of 71. It has an SJR impact factor of 2,312 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 2,312.

ISSN: 0095-8956
Editorial: Academic Press Inc.
Category: Computational Theory and Mathematics
Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD
schedule Datos CoP · solo campos en BD
SJR Impact Factor trending_up
2,312 Q1
H-index 71
Tasa de Aceptación pie_chart
28% Selectiva
Fuente Acceptance_Rate
Tiempo a publicación hourglass_top
NPD
Campo Sin dato
Coste de Publicación (APC) payments
NPD Subscription
Ruta Non-OA NPD

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

2,312

H-index

71

Docs (year)

85

Docs 3y

250

Total refs

2163

Cites 3y

416

Citable 3y

249

Cites/Doc 2y

1.73

Ref/Doc

25.45

Immediate OA

—

Embargoed OA

NPD

Non OA / Submission

—

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Arc Colorings of Digraphs

View more

Weakly distance-regular digraphs

View more

Corrigendum to Proof of Chvatal's conjecture on maximal stable sets and maximal cliques in graphs

View more

Contractible Edges and Triangles in k-Connected Graphs

View more

Colouring of cubic graphs by Steiner triple systems

View more

Coloring Locally Bipartite Graphs on Surfaces

View more

Closure and Forbidden Pairs for Hamiltonicity

View more

Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

View more

Circular Colouring and Orientation of Graphs

View more

Branch-Width and Well-Quasi-Ordering in Matroids and Graphs

View more

Bounded degree acyclic decompositions of digraphs

View more

Asymptotically the List Colouring Constants Are 1

View more
SHOW MORE ARTICLES

Arrangements, circular arrangements and the crossing number of C7?oCn

View more

2-factors with k cycles in Hamiltonian graphs

View more

Another Proof of the Map Color Theorem for Nonorientable Surfaces

View more

An interpolation theorem for partitions which are complete with respect to hereditary properties

View more

A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property

View more

A short proof of non-GF(5)-representability of matroids

View more

A new proof of a characterisation of Pfaffian bipartite graphs

View more

A new inequality for bipartite distance-regular graphs

View more

A jump to the bell number for hereditary graph properties

View more

A Fully Combinatorial Algorithm for Submodular Function Minimization

View more

A decomposition theory for matroids. VI. Almost regular matroids

View more

A Continuous Analogue of the Girth Problem

View more

FAQS