Generalized graph cordiality
From MaRDI portal
Recommendations
Cited in
(18)- A-cordial graphs
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
- On some graph-cordial abelian groups
- Uniformly cordial graphs
- Some new results on k-cordial labeling.
- Generalization of some results on cordial graphs.
- 4-cordiality of some regular graphs and the complete 4-partite graph
- scientific article; zbMATH DE number 5307941 (Why is no real title available?)
- Path-cordial abelian groups
- All trees are six-cordial
- Klein cordial trees and odd cyclic cordial friendship graphs
- scientific article; zbMATH DE number 7708012 (Why is no real title available?)
- Pair difference cordiality of certain subdivision graphs
- The cordiality game and the game cordiality number
- (2, 3)-cordial trees and paths
- (2, 3)-cordial oriented hypercubes
- E_A-cordial labeling of graphs and its implications for A-antimagic labeling of trees
- Cordiality of digraphs
This page was built for publication: Generalized graph cordiality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648787)