arXiv:0709.0290·math.CO·September 4, 2007
$\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs
Adrian Riskin

TL;DR
This paper characterizes when complete and complete bipartite graphs are $\
Contribution
It establishes precise conditions for $\
Findings
01
$K_{n}$ is $\
02
$K_{m,n}$ is $\
03
The results clarify the $\
Abstract
We prove that is -cordial if and only if and that is if and only if it is false that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Graph theory and applications
