World's Best Scientists 2026 revealed!
Journal of Combinatorial Theory. Series B
H-index 18

Journal of Combinatorial Theory. Series B

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 113 49 99 17
Computer Science 373 34 69 16
Engineering and Technology 851 11 37 10

Additional Metrics

Number of Best Scientists*: 57
Documents by Best Scientists*: 109
Top 100 Ranked Scientists*: 5
SCIMAGO H-index: 71
SCIMAGO SJR: 2.312
Impact Factor: 1.2

Overview

Top Research Topics at Journal of Combinatorial Theory, Series B?

The objective of the journal is to combine knowledge in the areas of Combinatorics, Discrete mathematics, Graph, Conjecture and Matroid. Journal of Combinatorial Theory, Series B tackles issues in Combinatorics, particularly in the topics of Chordal graph, Planar graph, Indifference graph, Graph power and Vertex (graph theory). It links adjacent topics like Chordal graph with Pathwidth.

Issues in Planar graph were discussed, taking into consideration concepts from other disciplines like Outerplanar graph and Book embedding. Journal of Combinatorial Theory, Series B covers various topics on Discrete mathematics such as Line graph, 1-planar graph, Forbidden graph characterization, Complement graph and Symmetric graph. The study on Line graph featured in Journal of Combinatorial Theory, Series B expounds on the topic of Voltage graph in particular.

It focuses on Forbidden graph characterization research which is adjacent to topics in Universal graph. While Graph is the focus of the journal, it also provided insights into the studies of Disjoint sets, Chromatic scale and Upper and lower bounds. Most of the Matroid studies addressed also intersect with Minor (linear algebra).

  • Combinatorics (99.84%)
  • Discrete mathematics (72.74%)
  • Graph (25.76%)

What are the most cited papers published in the journal?

  • Graph minors. XIII: the disjoint paths problem (1086 citations)
  • λ1, Isoperimetric inequalities for graphs, and superconcentrators (802 citations)
  • Limits of dense graph sequences (754 citations)

Research areas of the most cited articles at Journal of Combinatorial Theory, Series B:

The most cited papers mostly deal with topics like Combinatorics, Discrete mathematics, Graph, Chordal graph and Indifference graph. Planar graph, Line graph, Conjecture, Graph power and Complement graph are among the areas of Combinatorics tackled in the journal publications. Clique-sum and Maximal independent set are some topics wherein Indifference graph research discussed in the most cited publications has an impact.

What topics the last edition of the journal is best known for?

  • Combinatorics
  • Geometry
  • Algebra

The previous edition focused in particular on these issues:

Journal of Combinatorial Theory, Series B facilitates discussions on Combinatorics, Graph, Logarithm, Connection (mathematics) and Complete graph. While work presented in it provided substantial information on Combinatorics, it also covered topics in Simple (abstract algebra) and Arbitrarily large. The journal focuses on Logarithm but the discussions also offer insight into other areas such as Structure (category theory), Clique (graph theory), Order (ring theory) and Integer.

Topics in Connection (mathematics) were tackled in line with various other fields like Graphic matroid, Matroid, Affine transformation, Binary number and Rank (graph theory). Minor (linear algebra), Bounded function and Treewidth are some topics wherein Complete graph research discussed in it have an impact. It holds forums on Conjecture that merges themes from other disciplines such as Induced subgraph, Tree (data structure), Path (graph theory), Upper and lower bounds and Order (group theory).

The most cited articles from the last journal are:

  • Triangle resilience of the square of a Hamilton cycle in random graphs (0 citations)
  • A lower bound on the average size of a connected vertex set of a graph (0 citations)
  • The threshold bias of the clique-factor game (0 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Journal of Combinatorial Theory, Series B (based on the number of publications) are:

  • Paul Seymour (114 papers) absent at the last edition,
  • Carsten Thomassen (68 papers) absent at the last edition,
  • Ken-ichi Kawarabayashi (48 papers) absent at the last edition,
  • Maria Chudnovsky (47 papers) absent at the last edition,
  • Robin Thomas (46 papers) absent at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Journal of Combinatorial Theory, Series B (based on the number of publications) are:

  • University of Waterloo (184 papers) absent at the last edition,
  • Princeton University (100 papers) absent at the last edition,
  • Ohio State University (82 papers) absent at the last edition,
  • Georgia Institute of Technology (80 papers) absent at the last edition,
  • Charles University in Prague (66 papers) absent at the last edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2022 edition, 37.50% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 40.00% were posted by at least one author from the top 10 institutions publishing in the journal. Another 20.00% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 0.00% of all publications and 40.00% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • Polynomial bounds for centered colorings on proper minor-closed graph classes

    Michał Pilipczuk;Sebastian Siebertz

    (2021)
    38 Citations
  • Edge-transitive bi-Cayley graphs

    Marston Conder;Jin-Xin Zhou;Yan-Quan Feng;Mi-Mi Zhang

    (2020)
    36 Citations
  • Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings

    Maria Chudnovsky;Alex Scott;Paul D. Seymour

    (2021)
    36 Citations
  • Planar graphs that need four pages

    Mihalis Yannakakis

    (2020)
    32 Citations
  • Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes

    Maria Chudnovsky;Alex Scott;Paul D. Seymour;Sophie Spirkl

    (2020)
    31 Citations
  • The inverse eigenvalue problem of a graph: Multiplicities and minors

    Wayne Barrett;Steve Butler;Shaun M. Fallat;H. Tracy Hall

    (2020)
    30 Citations

Related Online Degrees & Career Pathways

For those interested in expanding their expertise beyond a traditional Computer Science degree, exploring related online programs can be a strategic move. Many students look for easy masters programs that offer flexibility without compromising quality. These programs often provide a practical approach, ideal for working professionals aiming to boost their skills efficiently.

Cost is another major consideration when pursuing advanced education. Finding cheapest online doctoral programs can help learners achieve the highest levels of education without excessive financial burden. Pairing affordability with quality makes these programs attractive for long-term career development.

For undergraduates or those just starting out, identifying the cheapest online college options that accept FAFSA is crucial. These institutions provide affordable pathways to earn recognized degrees while also leveraging available financial aid resources.

Additionally, complementing a degree with professional credentials is a proven way to increase employability. There are numerous easy licenses and certifications to get online that enhance your resume and often result in higher salaries. Combining these certifications with your education can open up diverse career pathways in technology and beyond.

Best Scientists Contributing to This Journal

Recently Published Articles