Discussiones Mathematicae Graph Theory 26(1) (2006)
1
L.M. Harris, J.H. Hattingh, M.A. Henning
Algorithmic aspects of total k-subdomination in graphs
PDF
PS
5
2
J.J. Montellano-Ballesteros
An anti-Ramsey Theorem on edge-cutsets
PDF
PS
19
3
A. Ainouche
Extension of several sufficient conditions for Hamiltonian graphs
PDF
PS
23
4
I. Peterin
A charaterization of planar median graphs
PDF
PS
41
5
Y.Z Fan, Y. Wang
Special integral variation of trees
PDF
PS
49
6
D.A. Mojdeh
Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
PDF
PS
59
7
A.V. Kostochka, D.B. West
Chvátal's Condition cannot hold for both a graph and its complement
PDF
PS
73
8
H.M. Mulder, L. Nebeskę
Leaps: an approach to the block structure of a graph
PDF
PS
77
9
W. He, Yu-Fa Shen, Y. Zhao
The use of Euler's formula in (3,1)*-list-coloring
PDF
PS
91
10
P. Dorbec, S. Gravier, S. KlavŸar, S. ©pacapan
Some results on total domination in direct products of graphs
PDF
PS
103
11
M.M.M. Jaradat
On the basic number and the minimum cycle bases of the wreath product of some graphs I.
PDF
PS
113
12
W. Imrich, P.F. Stadler
A prime factor theorem for a generalized direct product
PDF
PS
135
13
S. El-Zanati, C. Vanden Eynden
Decomposing complete graphs into cubes
PDF
PS
141
14
R.W. Hung
Optimal edge ranking of complete bipartite graphs in polynomial time
PDF
PS
149
15
A.A. Dobrynin, L.S Mel'nikov
Wiener index of generalized stars and their quadratic line graphs
PDF
PS
161
Your IP address:3.209.80.87