Graphs and Combinatorics is an international journal, which was established in 1985.

It is devoted to research concerning all aspects of combinatorial mathematics, especially graph theory and discrete geometry. In addition to original research papers, the journal also publishes one major survey article each year. Notable survey articles include

• Ronald J. Gould, Advances on the Hamiltonian Problem – A Survey (2003)
• Bert Randerath and Ingo Schiermeyer, Vertex Colouring and Forbidden Subgraphs – A Survey (2004)
• Xueliang Li, Yongtang Shi, Yuefang Sun, Rainbow Connections of Graphs: A Survey (2013)
• Ronald J. Gould, Recent Advances on the Hamiltonian Problem: Survey III (2014)

Graphs and Combinatorics is published bimonthly, and time between acceptance and publication in an issue is currently three months. The range of coverage is extensive:

• Algebraic Combinatorics
• Combinatorial Design Theory
• Discrete Geometry
• Extremal Set Theory
• Graph Theory

Commonly used title abbreviations: Graphs Combin.

96% of authors who answered a survey reported that they would definitely publish or probably publish in the journal again