Graceful and cordial labeling of subdivision of graphs (Q327634): Difference between revisions

@@ Property / cites work @@
+Q3960885
@@ Property / cites work: Q3960885 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4724671
@@ Property / cites work: Q4724671 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5461579
@@ Property / cites work: Q5461579 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles with a chord are graceful
@@ Property / cites work: Cycles with a chord are graceful / rank @@
+Normal rank
@@ Property / cites work @@
+A dynamic survey of graph labeling
@@ Property / cites work: A dynamic survey of graph labeling / rank @@
+Normal rank
@@ Property / cites work @@
+Subdivision of ladders are graceful
@@ Property / cites work: Subdivision of ladders are graceful / rank @@
+Normal rank
@@ Property / cites work @@
+Q3955393
@@ Property / cites work: Q3955393 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5589124
@@ Property / cites work: Q5589124 / rank @@
+Normal rank
@@ Property / cites work @@
+Graceful numbering of an edge-gluing of shell graphs
+Normal rank
@@ Property / cites work @@
+One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial
+Normal rank