A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="http://www.combinatorics.org/files/Surveys/ds6/ds6v17-2014.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
A Dynamic Survey of Graph Labeling
<span title="">2014</span>
<i >
the electronic journal of combinatorics
</i>
<span class="release-stage">unpublished</span>
Preserved Fulltext
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening 50 years nearly 200 graph labelings techniques have been studied in over 2000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/uswwtsjqqng5vf23pp5sox4wjy">fatcat:uswwtsjqqng5vf23pp5sox4wjy</a>
</span>
more »
... ely available. In this survey I have collected everything I could find on graph labeling. For the convenience of the reader the survey includes a detailed table of contents and index.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180505055226/http://www.combinatorics.org/files/Surveys/ds6/ds6v17-2014.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
</button>
</a>