1990 | OriginalPaper | Buchkapitel
Numberings on Graphs Having Small Edge Weights
verfasst von : R. Lang
Erschienen in: Topics in Combinatorics and Graph Theory
Verlag: Physica-Verlag HD
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Numbering problems on graphs have been investigated intensively for the past three decades. One of the best known of these problems, the RINGEL—tree—numbering—problem, remains unsolved to he present. It consists in proving that all trees are graceful ([3],[7]). Another significant numbering problem on graphs is the bandwidth problem ([2]).