On the Range of Possible Integrities of Graphs G(n, k) Mustafa AticiClaus Ernst Original Paper 26 October 2010 Pages: 475 - 485
Forbiddance and Capacity Emanuela FachiniJános Körner Original Paper 16 October 2010 Pages: 495 - 503
On the Roman Bondage Number of Planar Graphs Nader Jafari RadLutz Volkmann Original Paper 07 September 2010 Pages: 531 - 538
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected Petteri KaskiVeli MäkinenPatric R. J. Östergård Original Paper 25 September 2010 Pages: 539 - 546
Pairs of Chromatically Equivalent Graphs Kerri Morgan Original Paper 01 October 2010 Pages: 547 - 556
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs Stavros D. NikolopoulosCharis Papadopoulos Original Paper 20 October 2010 Pages: 557 - 565
Cleaning Random d-Regular Graphs with Brooms Paweł Prałat Original Paper 05 October 2010 Pages: 567 - 584
Metric Dimension and R-Sets of Connected Graphs Ioan TomescuMuhammad Imran Original Paper 19 October 2010 Pages: 585 - 591
The Spectrum of Tetrahedral Quadruple Systems Jian WangMiao LiangBeiliang Du Original Paper 02 October 2010 Pages: 593 - 602
Characterizations of Bent and Almost Bent Function on \({\mathbb{Z}_p^2}\) Xiyong ZhangHua GuoZongsheng Gao Original Paper 16 September 2010 Pages: 603 - 620