Discussiones Mathematicae Graph Theory 24(3) (2004)

1
G. T. Chen, R. J. Faudree, R. J. Gould, M.S. Jacobson, L. Lesniak, F. Pfender
Linear forests and ordered cycles
PDF PS

359
2
W.F. Klostermeyer, G. MacGillivray
Analogues of cliques for oriented coloring
PDF PS

373
3
B.L. Hartnell, D.F. Rall
On dominating the Cartesian product of a graph and K2
PDF PS

389
4
T. Madaras
On the structure of plane graphs of minimum face size 5
PDF PS

403
5
E. Boros, R.E. Jamison, R.C. Laskar, H.M. Mulder
On 3-simplicial vertices in planar graphs
PDF PS

413
6
F. Dahme, D. Rautenbach, L. Volkmann
Some remarks on alpha-domination
PDF PS

423
7
M. Kouider, P.D. Vestergaard
Even [a,b]-factors in graphs
PDF PS

431
8
M. Pil¶niak
Packing of three copies of a digraph into the transitive tournament
PDF PS

443
9
T.W. Haynes, M.A. Henning, L.S. Hopkins
Total domination subdivision numbers of graphs
PDF PS

457
10
J. Polcyn
Short paths in 3-uniform quasi-random hypergraphs
PDF PS

469
11
I.E. Zverovich, O.I. Zverovich
Dominant-matching graphs
PDF PS

485
12
S. Bendall, R. Hammack
Centers of n-fold tensor products of graphs
PDF PS

491
13
G. Bacsó, Zs. Tuza
Graphs without induced P5 and C5
PDF PS

503
14
M. Sonntag
Difference labelling of digraphs
PDF PS

509
15
H. Galeana-Sánchez
Cycle-pancyclism in bipartite tournaments II
PDF PS

529
16
S.M. Zhou
A Gallai-type equality for the total domination number of a graph
PDF PS

539

Problems Column

17
L. Haddad, C. Tardif
A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
PDF PS

545

Your IP address:54.81.237.159