On cordial labeling of hypertrees

zbMath1430.05105arXiv1711.06294MaRDI QIDQ5207840

Krzysztof Węsek, Michał Tuczyński, Przemysław Wenus

Publication date: 13 January 2020

Full work available at URL: https://arxiv.org/abs/1711.06294

zbMATH Keywords

hypergraphhypertree\(k\)-cordial graphhypergraph labeling

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Klein cordial trees and odd cyclic cordial friendship graphs ⋮ \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs

This page was built for publication: On cordial labeling of hypertrees