Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference20 articles.
1. Cordial graphs: a weaker version of graceful and harmonious graphs;Cahit;Ars Comb.,1987
2. The computational complexity of cordial and equitable labelling;Cairnie;Discrete Math.,2000
3. Z2×Z2-cordial cycle-free hypergraphs;Cichacz;Discuss. Math., Graph Theory,2021
4. Cordial labeling of hypertrees;Cichacz;Discrete Math.,2013
5. On some graph-cordial abelian groups;Cichacz;Discrete Math.,2022