Discussiones Mathematicae Graph Theory 32 (1) (2012)
1 | I. Sahul Hamid | 5 | |
2 | A.P. Santhakumaran | 19 | |
3 | T. Vetrik | 31 | |
4 | KM. Kathiresan, K. Muthu Guru Packiam | 39 | |
5 | S. Wang, S. Zhang | 47 | |
6 | F. Fujie, K. Kolasinski, J. Lin, P. Zhang | 63 | |
7 | M. Dorfling, S. Dorfling | 81 | |
8 | P.T. Ho The projective plane crossing number of the circulant graph $C$($3k;\{1,k\}$) | 91 | |
9 | T. Jebaraj, A.P. Santhakumaran | 109 | |
10 | S. Arockiaraj, KM. Kathiresan | 121 | |
11 | S.M. Sheikholeslami, L. Volkmann | 129 | |
12 | O.V. Borodin, A.O. Ivanova 2-distance 4-colorability of planar subcubic graphs with girth at least 22 | 141 | |
13 | M. Hailat | 153 | |
14 | S. Benecke, C.M. Mynhardt | 161 | |
15 | P. Gregor, R. Škrekovski | 177 | |
16 | P. Gordinowicz, P. Prałat The first player wins the one-colour triangle avoidance game on 16 vertices | 181 |