Difference labelling of cacti

Martin Sonntag
2003 Discussiones Mathematicae Graph Theory  
It is known that trees, cycles, complete graphs, the complete bipartite graphs K n,n and K n,n−1 , pyramids and n-sided prisms (n ≥ 4) are difference graphs (cf. [4]). Giving a special labelling algorithm, we prove that cacti with a girth of at least 6 are difference graphs, too.
doi:10.7151/dmgt.1185 fatcat:pk5t4wkxh5emjpkekikbbjfuxy