I have
introduced cordial labelling
of trees and graphs in 1987 as weakened
version of the less tractable graceful, harmonious and
magic labellings. This page is the first step to give
information on open problems, recent results on cordial
and related graph labelling problems e.g., equitable,
h-cordial, A-cordial and graceful, harmonious and magic
labellings. If you know any paper not in the list or have
a labelling problem please inform us for the inclusion
here.

We hope that in a near future we
will have down-loadable preprint service for the new
results. For suggestions and comments write directly to
me at

V.N.
Bhat-Nayak Equitable Labelings of Graphs : An
Update To appear in the Proceedings of the
Conference on Graph Theory and its Applications
held at School of Mathematics, Anna University,
Chennai 600 025, March 14-16, 2001.

V.N.
Bhat-Nayak Minimal 3-Equitability of $C_{2n} O
K_1$ with (Manisha Acharya) to appear in the
Proceedings of National Conference on Discrete
Mathematics and its Applications held at M.S.
University, Thirunelveli, Jan 5-7, 2000.

V.N.
Bhat-Nayak Minimal n-Equitability of $C_{2n} O
K_1m, C_{3n} O K_1$ and $C_{5n}O K_1$ with
(Manisha Acharya) to appear in the Proceedings of
the conference on Graph Theory and its
Applications held at School of Mathematics, Anna
University, Chennai, 14-16 March, 2001.

V.N.
Bhat-Nayak Minimal $k$-Equitability of paths
$P_{kn+1}$ with (Manisha Acharya) sent for
publication.