1. Cordial graphs: a weaker version of graceful and harmonious graphs;Cahit;Ars Combin.,1987
2. The computational complexity of cordial and equitable labelling;Cairnie;Discrete Math.,2000
3. Cordiality of complete k-partite graphs and some special graphs;Du;Neimenggu Shida Xuebao Ziran Kexue Hanwen Ban,1997
4. A dynamic survey of graph labeling;Gallian;Electron. J. Combin.,2012
5. A-cordial graphs;Hovey;Discrete Math.,1991