@ARTICLE{Wawrzyniak2024:i58335,
author="{Wawrzyniak, Piotr and Formanowicz, Piotr}",
title="{Graph realization of sets of integers}",
year="2024",
type="scientific article",
language="en",
journal="{Journal of Mathematical Chemistry}",
issn="0259-9791",
volume="62",
number="8",
pages="1965--1981",
doi="10.1007/s10910-024-01642-4",
url="https://link.springer.com/article/10.1007/s10910-024-01642-4",
keywords="Computational chemistry; Graph theory; Polynomial algorithm; Structure elucidation",
abstract="{Graph theory is used in many areas of chemical sciences, especially in molecular chemistry. It is particularly useful in the structural analysis of chemical compounds and in modeling chemical reactions. One of its applications concerns determining the structural formula of a chemical compound. This can be modeled as a variant of the well-known graph realization problem. In the classical version of the problem, a sequence of natural numbers is given, and the question is whether there exists a graph in which the vertices have degrees equal to the given numbers. In the variant considered in this paper, instead of a sequence of natural numbers, a sequence of sets of natural numbers is given, and the question is whether there exists a multigraph such that each of its vertices has a degree equal to a number from one of the sets. This variant of the graph realization problem matches the nature of the problem of determining the structural formula of a chemical compound better than other variants considered in the literature. We propose a polynomial time exact algorithm solving this variant of the problem.}",
}