\( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs

DOI10.7151/dmgt.2226zbMath1468.05195arXiv1808.06247OpenAlexW3124277973MaRDI QIDQ2042612

Sylwia Cichacz, Zsolt Tuza, Agnieszka Goerlich

Publication date: 21 July 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

hypergraph\(V_4\)-cordial graphhyper-treelabeling of hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Klein cordial trees and odd cyclic cordial friendship graphs ⋮ On some graph-cordial abelian groups

Cites Work

• Unnamed Item
• Cordial labeling of hypertrees
• Hypergraphs and a functional equation of Bouwkamp and de Bruijn
• A-cordial graphs
• A dynamic survey of graph labeling
• The computational complexity of cordial and equitable labelling
• Generalized graph cordiality
• All trees are six-cordial
• On cordial labeling of hypertrees

This page was built for publication: \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs