English

A note on $k$-cordial $p$-uniform hypertrees

Combinatorics 2012-04-05 v1

Abstract

Hovey introduced a kk-cordial labeling of graphs as a generalization both of harmonious and cordial labelings. He proved that all tress are kk-cordial for k{1,...,5}k \in \{1,...,5\} and he conjectured that all trees are kk-cordial for all kk. \indent We consider a corresponding problem for hypergraphs, namely, we show that pp-uniform hypertrees are kk-cordial for certain values of kk.

Cite

@article{arxiv.0910.2344,
  title  = {A note on $k$-cordial $p$-uniform hypertrees},
  author = {Sylwia Cichacz and Agnieszka Goerlich},
  journal= {arXiv preprint arXiv:0910.2344},
  year   = {2012}
}
R2 v1 2026-06-21T13:57:39.240Z