Pages that link to "Item:Q1567263"
From MaRDI portal
The following pages link to The computational complexity of cordial and equitable labelling (Q1567263):
Displayed 9 items.
- On friendly index sets of the edge-gluing of complete graph and cycles (Q334119) (← links)
- Full friendly index set. I (Q385157) (← links)
- Cordial labeling of hypertrees (Q393911) (← links)
- On friendly index sets of 2-regular graphs (Q998432) (← links)
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs (Q2042612) (← links)
- On 3-total edge product cordial labeling of a carbon nanotube network (Q2176162) (← links)
- On friendly index sets of k-galaxies (Q5009929) (← links)
- On total edge product cordial labeling of fullerenes (Q5009985) (← links)
- Klein cordial trees and odd cyclic cordial friendship graphs (Q6098079) (← links)