Graphs and Combinatorics Journal Impact Factor & Information
Journal description
Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers and survey articles the journal also features short communications research problems and announcements. As particular attention is being paid to rapid publication researchers not only rely on Graphs and Combinatorics to keep them informed of current developments but also use it as a forum for publicizing their own work. Graphs and Combinatorics covers: graph theory combinatorics
Current impact factor: 0.39
Impact Factor Rankings
2015 Impact Factor  Available summer 2016 

2014 Impact Factor  0.388 
2013 Impact Factor  0.331 
2012 Impact Factor  0.351 
2011 Impact Factor  0.319 
2010 Impact Factor  0.242 
2009 Impact Factor  0.571 
2008 Impact Factor  0.302 
2007 Impact Factor  0.375 
2006 Impact Factor  0.175 
2005 Impact Factor  0.299 
2004 Impact Factor  0.235 
2003 Impact Factor  0.159 
2002 Impact Factor  0.165 
2001 Impact Factor  0.205 
2000 Impact Factor  0.085 
1999 Impact Factor  0.242 
1998 Impact Factor  0.159 
1997 Impact Factor  0.183 
1996 Impact Factor  0.118 
1995 Impact Factor  0.198 
1994 Impact Factor  0.215 
1993 Impact Factor  0.211 
1992 Impact Factor  0.181 
Impact factor over time
Additional details
5year impact  0.44 

Cited halflife  8.30 
Immediacy index  0.07 
Eigenfactor  0.00 
Article influence  0.48 
Website  Graphs and Combinatorics website 
Other titles  Graphs and combinatorics (Online), Graphs & combinatorics 
ISSN  09110119 
OCLC  39980543 
Material type  Document, Periodical, Internet resource 
Document type  Internet Resource, Computer File, Journal / Magazine / Newspaper 
Publisher details
 Preprint
 Author can archive a preprint version
 Postprint
 Author can archive a postprint version
 Conditions
 Author's preprint on preprint servers such as arXiv.org
 Author's postprint on author's personal website immediately
 Author's postprint on any open access repository after 12 months after publication
 Publisher's version/PDF cannot be used
 Published source must be acknowledged
 Must link to publisher version
 Set phrase to accompany link to published version (see policy)
 Articles in some journals can be made Open Access on payment of additional charge
 Classification green
Publications in this journal
 Graphs and Combinatorics 11/2015; DOI:10.1007/s0037301516440
 Graphs and Combinatorics 11/2015; DOI:10.1007/s0037301516431
 Graphs and Combinatorics 11/2015; DOI:10.1007/s003730151646y
 Graphs and Combinatorics 10/2015; DOI:10.1007/s003730151639x
 Graphs and Combinatorics 10/2015; DOI:10.1007/s003730151638y
 Graphs and Combinatorics 10/2015; DOI:10.1007/s0037301516235
 Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516351
 Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516271
 Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516315
 Graphs and Combinatorics 09/2015; DOI:10.1007/s003730151629z
 Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516262
 Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516253
 Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516244

Article: 3Regular Maps on Closed Surfaces are Nearly Distinguishing 3Colorable with Few Exceptions
Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516208  Graphs and Combinatorics 09/2015; DOI:10.1007/s0037301516226
 [Show abstract] [Hide abstract]
ABSTRACT: If X is a geodesic metric space and \(x_1,x_2,x_3\) are three points in \(X\), a geodesic triangle \(T=\{x_1,x_2,x_3\}\) is the union of three geodesics \([x_1x_2]\), \([x_2x_3]\) and \([x_3x_1]\) in \(X\). The space \(X\) is \(\delta \)hyperbolic \((\)in the Gromov sense\()\) if any side of \(T\) is contained in a \(\delta \)neighborhood of the union of the two other sides, for every geodesic triangle \(T\) in \(X\). The study of hyperbolic graphs is an interesting topic since the hyperbolicity of a geodesic metric space is equivalent to the hyperbolicity of a graph related to it. In this paper we obtain criteria which allow us to decide, for a large class of graphs, whether they are hyperbolic or not. We are especially interested in the planar graphs which are the “boundary” (the \(1\)skeleton) of a tessellation of the Euclidean plane. Furthermore, we prove that a graph obtained as the \(1\)skeleton of a general CW \(2\)complex is hyperbolic if and only if its dual graph is hyperbolic.Graphs and Combinatorics 09/2015; 31(5):13111324. DOI:10.1007/s0037301414594  Graphs and Combinatorics 09/2015; 31(5):17391754. DOI:10.1007/s0037301414843
 Graphs and Combinatorics 08/2015; DOI:10.1007/s0037301516182
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.