Researcher.Life Logo

European Journal of Combinatorics : Impact Factor & More

eISSN: 1095-9971pISSN: 0195-6698

Aims and Scope of European Journal of Combinatorics

The European Journal of Combinatorics is a closed-access peer-reviewed scientific journal for combinatorics. It is an international, bimonthly journal of discrete mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and the theories of computing. The journal includes full-length research papers, short notes, and research problems on several topics. This journal has been founded by Michel Deza, Michel Las Vergnas and Pierre Rosenstiehl. The current editor-in-chief is Patrice Ossona de Mendez. Less

Key Metrics

CiteScore
1.7
Impact Factor
< 5
SJR
Q2Discrete Mathematics and Combinatorics
SNIP
1.28
Recommended pre-submission checks
Powered by Paperpal by Editage

Topics Covered on European Journal of Combinatorics

European Journal of Combinatorics Journal Specifications

Indexed in the following public directories

  • Web of Science Web of Science
  • Scopus Scopus
  • SJR SJR
Overview
Publisher ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD
Language English
Frequency Bi-monthly
General Details
LanguageEnglish
FrequencyBi-monthly
Publication Start Year1980
Publisher URLVisit website
Website URLVisit website
View less

Planning to publish in European Journal of Combinatorics ?

Upload your Manuscript to get

  • Degree of match
  • Common matching concepts
  • Additional journal recommendations
Free Report

Recently Published Papers in European Journal of Combinatorics

A construction of 2-arc-transitive non-solvable covers of complete graphs
  • 1 Jul 2026
  • European Journal of Combinatorics
Inequalities on the total number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e574" altimg="si19.svg"> <mml:mi>t</mml:mi> </mml:math> -hooks of partitions
  • 1 Jul 2026
  • European Journal of Combinatorics
Separating trees and simple congruences of the weak order
  • 1 Jul 2026
  • European Journal of Combinatorics
Majorization and inequalities among complete homogeneous symmetric functions
  • 1 Jul 2026
  • European Journal of Combinatorics
A Bose–Laskar–Hoffman theory for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e22" altimg="si12.svg"> <mml:mi>μ</mml:mi> </mml:math> -bounded graphs with fixed smallest eigenvalue
  • 1 Jul 2026
  • European Journal of Combinatorics
Counting the maximum number of sunflowers in hypergraphs with given matching number
  • 1 Jul 2026
  • European Journal of Combinatorics
A construction of 2-arc-transitive non-solvable covers of complete graphs
  • 1 Jul 2026
  • European Journal of Combinatorics
Inequalities on the total number of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e574" altimg="si19.svg"> <mml:mi>t</mml:mi> </mml:math> -hooks of partitions
  • 1 Jul 2026
  • European Journal of Combinatorics
Separating trees and simple congruences of the weak order
  • 1 Jul 2026
  • European Journal of Combinatorics
Majorization and inequalities among complete homogeneous symmetric functions
  • 1 Jul 2026
  • European Journal of Combinatorics
A Bose–Laskar–Hoffman theory for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e22" altimg="si12.svg"> <mml:mi>μ</mml:mi> </mml:math> -bounded graphs with fixed smallest eigenvalue
  • 1 Jul 2026
  • European Journal of Combinatorics
Counting the maximum number of sunflowers in hypergraphs with given matching number
  • 1 Jul 2026
  • European Journal of Combinatorics

FAQs on European Journal of Combinatorics