World's Best Scientists 2026 revealed!
Electronic Journal of Combinatorics
H-index 12

Electronic Journal of Combinatorics

1097-1440

Published by: Electronic Journal of Combinatorics

https://www.combinatorics.org/

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 226 71 115 11
Computer Science 650 41 65 8
Engineering and Technology 1025 15 30 7

Additional Metrics

Number of Best Scientists*: 96
Documents by Best Scientists*: 145
Top 100 Ranked Scientists*: 7
SCIMAGO H-index: 57
SCIMAGO SJR: 0.897
Impact Factor: N/A

Overview

Top Research Topics at Electronic Journal of Combinatorics?

Electronic Journal of Combinatorics primarily focuses on research topics in Combinatorics, Discrete mathematics, Graph, Conjecture and Upper and lower bounds. It concentrated on Combinatorics research, specifically Vertex (geometry), Bijection, Integer, Bipartite graph and Permutation. Partition (number theory) and Degree (graph theory) are some topics wherein Discrete mathematics research discussed in the journal have an impact.

Studies on Chordal graph discussed in the journal link to the field of Indifference graph.

  • Combinatorics (99.57%)
  • Discrete mathematics (44.23%)
  • Graph (16.99%)

What are the most cited papers published in the journal?

  • A Dynamic Survey of Graph Labeling (1558 citations)
  • Small Ramsey Numbers (451 citations)
  • Moore Graphs and Beyond: A survey of the Degree/Diameter Problem (298 citations)

Research areas of the most cited articles at Electronic Journal of Combinatorics:

The most cited papers generally zeroe in on subjects such as Combinatorics, Discrete mathematics, Graph, Conjecture and Vertex (geometry). The works on Combinatorics tackled in the published papers bring together disciplines like Upper and lower bounds and Type (model theory). The published articles explore research in Discrete mathematics and the adjacent study of Degree (graph theory).

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

  • Combinatorics
  • Algebra
  • Geometry

The previous edition focused in particular on these issues:

Electronic Journal of Combinatorics mostly deals with topics like Combinatorics, Conjecture, Graph, Degree (graph theory) and Graph (abstract data type). While Electronic Journal of Combinatorics focused on Combinatorics, it was also able to explore topics like Upper and lower bounds and Order (ring theory). Most of the Order (ring theory) studies addressed also intersect with Partially ordered set.

Conjecture study tackled is connected to the field of Constant (mathematics). The studies tackled, which mainly focus on Graph, apply to Bounded function as well.

The most cited articles from the last journal are:

  • Answers to Two Questions on the DP Color Function (5 citations)
  • A vertex-weighted tutte symmetric function, and constructing graphs with equal chromatic symmetric function (5 citations)
  • Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs (5 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 Electronic Journal of Combinatorics (based on the number of publications) are:

  • Alan Frieze (29 papers) published 2 papers at the last edition, 1 more than at the previous edition,
  • David R. Wood (23 papers) published 1 paper at the last edition the same number as at the previous edition,
  • Toufik Mansour (20 papers) absent at the last edition,
  • Edward A. Bender (18 papers) absent at the last edition,
  • Jeffrey B. Remmel (17 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 Electronic Journal of Combinatorics (based on the number of publications) are:

  • Massachusetts Institute of Technology (68 papers) absent at the last edition,
  • University of Waterloo (44 papers) absent at the last edition,
  • University of Illinois at Urbana–Champaign (44 papers) published 2 papers at the last edition, 1 less than at the previous edition,
  • University of California, San Diego (41 papers) published 1 paper at the last edition,
  • Nankai University (34 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 2021 edition, 94.25% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 30.00% were posted by at least one author from the top 10 institutions publishing in the journal. Another 10.00% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 10.00% of all publications and 50.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

  • The Maximum Spectral Radius of Graphs Without Friendship Subgraphs

    Sebastian M. Cioaba;Lihua Feng;Michael Tait;Xiao-Dong Zhang

    (2020)
    73 Citations
  • Counting linear extensions of restricted posets

    Samuel Dittmer;Igor Pak

    (2020)
    36 Citations
  • Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs

    (2022)
    24 Citations
  • Forbidden subgraphs of power graphs

    Pallabi Manna;Peter J. Cameron;Ranjit Mehatari

    (2021)
    18 Citations
  • Circular chromatic number of signed graphs

    Reza Naserasr;Zhouningxin Wang;Xuding Zhu

    (2021)
    17 Citations
  • Perfect state transfer on Cayley graphs over dihedral groups : the non-normal case

    Xiwang Cao;Bocong Chen;San Ling

    (2020)
    17 Citations

Related Online Degrees & Career Pathways

Pursuing a computer science degree online offers flexibility, affordability, and fast-tracked educational opportunities. Many students are drawn to programs that combine quality with cost-efficiency. Exploring the cheapest online bachelor degree options can significantly reduce the financial burden, making computer science more accessible to a wider audience.

Additionally, selecting a degree program from free application online colleges eliminates application fees, lowering entry barriers and simplifying the admission process.

For those eager to enter the workforce sooner, many students opt for fast degree programs, which allow completion in less time without compromising on educational quality. This acceleration is particularly beneficial in the tech industry, where up-to-date skills are crucial.

Choosing computer science as a major often leads to lucrative career paths, as highlighted by the best majors in college. Graduates can pursue roles in software development, data science, cybersecurity, and more, all offering strong earning potential and growth prospects.

Best Scientists Contributing to This Journal

Recently Published Articles