Discussiones Mathematicae Graph Theory 33(4) (2013)

1
G.R. Vijayakumar
Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues - 2
PDF PS

637
2
H. Liang
Some sharp bounds on the negative decision number of graphs
PDF PS

649
3
B. Park, Y. Sano
The phylogeny graphs of double partial orders
PDF PS

657
4
G. Karafová
Generalized fractional total coloring of complete graphs
PDF PS

665
5
R. J. Faudree, R. J. Gould, M.S. Jacobson
Weak saturation numbers for sparse graphs
PDF PS

677
6
V. Chitra , A. Muthusamy
Symmetric Hamilton cycle decompositions of complete multigraphs
PDF PS

695
7
L. Volkmann
Bounds on the signed 2-independence number in graphs
PDF PS

709
8
H. Aram, S. Norouzian, S.M. Sheikholeslami, L. Volkmann
The distance Roman domination numbers of graphs
PDF PS

717
9
R.C. Laskar, H.M. Mulder
Path-neigborhood graphs
PDF PS

731
10
O. Favaron
The b-domatic number of a graph
PDF PS

747
11
O.V. Borodin, A.O. Ivanova
Precise upper bound for the strong edge chromatic number of sparse planar graphs
PDF PS

756
12
E. Krop, I. Krop
Almost -rainbow edge-colorings of some small graphs
PDF PS

771
13
J. Azarija
Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs
PDF PS

785

Your IP address:54.198.245.233