Graphs and Combinatorics (ISSN 0911-0119, abbreviated Graphs Combin.) is a peer-reviewed academic journal in graph theory, combinatorics, and discrete geometry published by Springer Japan. Its editor-in-chief is Katsuhiro Ota of Keio University.[1]
The journal was first published in 1985. Its founding editor in chief was Hoon Heng Teh of Singapore, the president of the Southeast Asian Mathematics Society, and its managing editor was Jin Akiyama.[2] Originally, it was subtitled "An Asian Journal".[3]
In most years since 1999, it has been ranked as a second-quartile journal in discrete mathematics and theoretical computer science by SCImago Journal Rank.[4]
^Graphs and Combinatorics, Springer Science+Business Media, retrieved 2016-01-30.
^Kano, M.; Ruiz, Mari-Jo P.; Urrutia, Jorge (2007), "Jin Akiyama: A Friend and His Mathematics" (PDF), Graphs and Combinatorics, 23 (S1): 1–39, CiteSeerX 10.1.1.300.1275, doi:10.1007/s00373-007-0720-5, S2CID 6679546, archived from the original (PDF) on 2016-10-16, retrieved 2016-01-31.
^Götze, Heinz (2008), Springer-Verlag: History of a Scientific Publishing House: Part 2: 1945–1992. Rebuilding – Opening Frontiers – Securing the Future, translated by M. Schäfer, Springer-Verlag, p. 132, ISBN 9783540928881.
^Graphs and Combinatorics, SCImago Journal Rank, retrieved 2016-01-30.
and 23 Related for: Graphs and Combinatorics information
GraphsandCombinatorics (ISSN 0911-0119, abbreviated Graphs Combin.) is a peer-reviewed academic journal in graph theory, combinatorics, and discrete...
and estimates in the analysis of algorithms. A mathematician who studies combinatorics is called a combinatorialist. The full scope of combinatorics is...
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to...
Brouwer–Haemers graph (81 vertices), Berlekamp–van Lint–Seidel graph (243 vertices), and Games graph (729 vertices). In enumerative combinatorics, there are...
characterization of planar graphs in terms of forbidden graphs, now known as Kuratowski's theorem: A finite graph is planar if and only if it does not contain...
Algebraic combinatorics Analytic combinatorics Arithmetic combinatoricsCombinatorics on words Combinatorial design theory Enumerative combinatorics Extremal...
Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatoricsandgraph theory...
Eulerian graphs with size equivalent to 1 or 2 (mod 4) are not graceful. Whether or not certain families of graphs are graceful is an area of graph theory...
Harary, Frank (1988), "On the euclidean dimension of a wheel", GraphsandCombinatorics, 4 (1): 23–30, doi:10.1007/BF01864150, S2CID 44596093. Faudree...
complexity for non-perfect graphs. In addition, several important minimax theorems in combinatorics, including Dilworth's theorem and Mirsky's theorem on partially...
Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs. This is in contrast to geometric, combinatoric...
Planar graphs (In fact, planar graph isomorphism is in log space, a class contained in P) Interval graphs Permutation graphs Circulant graphs Bounded-parameter...
topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, spatial embeddings of graphs, andgraphs as topological...
undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the...
time on such classes of graphs, making graphs with few cliques of interest in computational graph theory, network analysis, and other branches of applied...
copy of the Petersen graph. As stated, this assumes that Cayley graphs need not be connected. Some sources require Cayley graphs to be connected, making...
Global Information