Discussiones Mathematicae Graph Theory 32(1) (2012)

1
I. Sahul Hamid
Independent transversal domination in graphs
PDF PS

5
2
A.P. Santhakumaran
Median of a graph with respect to edges
PDF PS

19
3
T. Vetrik
List coloring of complete multipartite graphs
PDF PS

31
4
KM. Kathiresan, K. Muthu Guru Packiam
On total vertex irregularity strength of graphs
PDF PS

39
5
S. Wang, S. Zhang
Embeddings of hamiltonian paths in faulty k-ary 2-cubes
PDF PS

47
6
F. Fujie, K. Kolasinski, J. Lin, P. Zhang
Vertex rainbow colorings of graphs
PDF PS

63
7
M. Dorfling, S. Dorfling
Recognizable colorings of cycles and trees
PDF PS

81
8
P.T. Ho
The projective plane crossing number of the circulant graph C(3k;{1,k})
PDF PS

91
9
T. Jebaraj, A.P. Santhakumaran
Double geodetic number of a graph
PDF PS

109
10
S. Arockiaraj, KM. Kathiresan
p-Wiener intervals and p-Wiener free intervals
PDF PS

121
11
S.M. Sheikholeslami, L. Volkmann
The k-rainbow domatic number of a graph
PDF PS

129
12
O.V. Borodin, A.O. Ivanova
2-distance 4-colorability of planar subcubic graphs with girth at least 22
PDF PS

141
13
M. Hailat
On generalization of the friendship theorem
PDF PS

153
14
S. Benecke, C.M. Mynhardt
Characterizing Cartesian fixers and multipliers
PDF PS

161
15
P. Gregor, R. ©krekovski
Parity vertex colorings of binomial trees
PDF PS

177
16
P. Gordinowicz, P. Prałat
The first player wins the one-colour triangle avoidance game on 16 vertices
PDF PS

181

Your IP address:54.81.237.159