Abbott and E.R. ICDS: … The journal is completely free for both authors and readers. SCImago Journal & Country Rank, Scopus Sources. Journal ISSN: 1077-8926 About Electronic Journal of Combinatorics Starting from the year 2010, the Journal of Combinatorics (JOC) will be launched, publishing high quality research papers in all branches of combinatorics and related areas, including both the … Discussiones Mathematicae Graph Theory/ 11. The journal was established in 1994 by Herbert Wilf (University of Pennsylvania) and Neil Calkin (Georgia Institute of Technology). Mitchell, Joshua P. Swanson, Sebastian Cioabă , Lihua Feng, Michael Tait, Xiao-Dong Zhang, Alin Bostan, Andrew Elvey Price, Anthony John Guttmann, Jean-Marie Maillard, Stijn Cambie, Bogdan Chornomaz, Zeev Dvir, Yuval Filmus, Shay Moran, Jaroslav Nešetřil, Patrice Ossona de Mendez, Michał Pilipczuk, Xuding Zhu, Saieed Akbari, Trent G. Marbach, Rebecca J. Stones, Zhuanhao Wu, Kyungyong Lee, George D. Nasr, Jamie Radcliffe, Emmanuella Sandratra Rambeloson, John Shareshian, Short Cycle Covers of Graphs with at Most 77% Vertices of Degree Two, On the Existence of Hamilton Cycles with a Periodic Pattern in a Random Digraph, Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs, Local Dimension is Unbounded for Planar Posets, Nonassociativity of the Norton Algebras of Some Distance Regular Graphs, Generalizing Tropical Kontsevich's Formula to Multiple Cross-Ratios, Sharper Bounds and Structural Results for Minimally Nonlinear 0-1 Matrices, The Bipartite $K_{2,2}$-Free Process and Bipartite Ramsey Number $b(2, t)$, The Maximum Spectral Radius of Graphs Without Friendship Subgraphs, Volumes of Flow Polytopes Related to Caracol Graphs, Stieltjes Moment Sequences for Pattern-Avoiding Permutations, Monochromatic Subgraphs in Iterated Triangulations, Harmonic Bases for Generalized Coinvariant Algebras, The Terwilliger Algebra of the Twisted Grassmann Graph: the Thin Case, The Maximum Number of Cliques in Hypergraphs without Large Matchings, Covering Small Subgraphs of (Hyper)Tournaments with Spanning Acyclic Subgraphs, Blockers for Triangulations of a Convex Polygon and a Geometric Maker-Breaker Game, The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd Degree, On the Longest Common Subsequence of Conjugation Invariant Random Permutations, On Fractional Fragility Rates of Graph Classes, A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $\rho$-Removed Uniform Matroids, Phylogenetic Trees, Augmented Perfect Matchings, and a Thron-type Continued Fraction (T-fraction) for the Ward Polynomials, A Counterexample to a Conjecture on Schur Positivity of Chromatic Symmetric Functions of trees, Finding Unavoidable Colorful Patterns in Multicolored Graphs, On Growth of the Set $A(A+1)$ in Arbitrary Finite Fields, Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice, Deducing a Variational Principle with Minimal A Priori Assumptions. [AbbW] H.L. The Electronic Journal of Combinatorics is a peer-reviewed open access scientific journal covering research in combinatorial mathematics.The journal was established in 1994 by Herbert Wilf (University of Pennsylvania) and Neil Calkin (Georgia Institute of Technology). The Electronic Journal of Combinatorics is a founding member of the Free Journal Network. ELECTRONIC JOURNAL OF COMBINATORICS related ISSN: 1097-1440 Country: United States. The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is completely free for both authors and readers. Combinatorica/ 7. Electronic Journal of Combinatorics/ 4. Thomas A. McCourt: Growth Rates of Groups associated with Face 2-Coloured Triangulations and … The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems. The Electronic Journal of Combinatorics is a peer-reviewed open access scientific journal covering research in combinatorial mathematics. Journal of Algebraic Combinatorics and SIAM Journal on Discrete Mathematics come to mind, for example. Journal of Combinatorial Optimization/ 5. The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems. According to the Journal Citation Reports, the journal had a 2017 impact factor of 0.762.[4]. Subject: COMPUTER SCIENCES; MATHEMATICS. The following people have been editors-in-chief of the Electronic Journal of Combinatorics: In addition to publishing normal articles, the journal also contains a class of articles called Dynamic Surveys that are not assigned to volumes and can be repeatedly updated by the authors.[5]. Publishes high-quality research papers on all branches of combinatorics and related areas, dealing with the structural, as well as algorithmic, aspects of these subjects. 4 … Publication. 4 issues per year Bibliographic content of The Electronic Journal of Combinatorics, Volume 23. The journal was established in 1994 by Herbert Wilf (University of Pennsylvania) and Neil Calkin (Georgia Institute of Technology). Electronic Journal of Combinatorics is a peer-reviewed scientific journal. Discrete Math/ 10. Metrics: SJR. Annals of Combinatorics publishes outstanding contributions to combinatorics with a particular focus on algebraic and analytic combinatorics, as well as the areas of graph and matroid theory. ELECTRONIC JOURNAL OF COMBINATORICS related ISSN: 1097-1440 Country: United States. Academic field: MATHEMATICS Indexed in: Science Citation Index Expanded, Scopus, zbMATH, DOAJ. Graphs and Combinatorics/ 6. The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems. E-JC was founded in 1994 by Herbert S. Wilf and Neil Calkin, making it one of the oldest electronic journals. OJAC is a refereed electronic journal based at the University of Rochester.